By Topic

Knowledge and Data Engineering, IEEE Transactions on

Issue 12 • Date Dec. 2006

Filter Results

Displaying Results 1 - 17 of 17
  • [Front cover]

    Publication Year: 2006 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (155 KB)  
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2006 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (94 KB)  
    Freely Available from IEEE
  • Regression Cubes with Lossless Compression and Aggregation

    Publication Year: 2006 , Page(s): 1585 - 1599
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (973 KB)  

    As OLAP engines are widely used to support multidimensional data analysis, it is desirable to support in data cubes advanced statistical measures, such as regression and filtering, in addition to the traditional simple measures such as count and average. Such new measures allow users to model, smooth, and predict the trends and patterns of data. Existing algorithms for simple distributive and alge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-Output Regularized Feature Projection

    Publication Year: 2006 , Page(s): 1600 - 1613
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2249 KB) |  | HTML iconHTML  

    Dimensionality reduction by feature projection is widely used in pattern recognition, information retrieval, and statistics. When there are some outputs available (e.g., regression values or classification results), it is often beneficial to consider supervised projection, which is based not only on the inputs, but also on the target values. While this applies to a single-output setting, we are mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structured Data Extraction from the Web Based on Partial Tree Alignment

    Publication Year: 2006 , Page(s): 1614 - 1628
    Cited by:  Papers (20)  |  Patents (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3713 KB) |  | HTML iconHTML  

    This paper studies the problem of structured data extraction from arbitrary Web pages. The objective of the proposed research is to automatically segment data records in a page, extract data items/fields from these records, and store the extracted data in a database. Existing methods addressing the problem can be classified into three categories. Methods in the first category provide some language... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cache-Conscious Automata for XML Filtering

    Publication Year: 2006 , Page(s): 1629 - 1644
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2673 KB) |  | HTML iconHTML  

    Hardware cache behavior is an important factor in the performance of memory-resident, data-intensive systems such as XML filtering engines. A key data structure in several recent XML filters is the automaton, which is used to represent the long-running XML queries in the main memory. In this paper, we study the cache performance of automaton-based XML filtering through analytical modeling and syst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Continuous Skyline Queries for Moving Objects

    Publication Year: 2006 , Page(s): 1645 - 1658
    Cited by:  Papers (20)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3038 KB) |  | HTML iconHTML  

    The literature on skyline algorithms has so far dealt mainly with queries of static query points over static data sets. With the increasing number of mobile service applications and users, however, the need for continuous skyline query processing has become more pressing. A continuous skyline query involves not only static dimensions, but also the dynamic one. In this paper, we examine the spatiot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logic and Computational Complexity for Boolean Information Retrieval

    Publication Year: 2006 , Page(s): 1659 - 1666
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (177 KB) |  | HTML iconHTML  

    We study the complexity of query satisfiability and entailment for the Boolean information retrieval models WP and AWV using techniques from propositional logic and computational complexity. WP and AWV can be used to represent and query textual information under the Boolean model using the concept of attribute with values of type text, the concept of word, and word proximity constraints. Variation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Algorithm for Computing Cube on Very Large Compressed Data Sets

    Publication Year: 2006 , Page(s): 1667 - 1680
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1779 KB) |  | HTML iconHTML  

    Data compression is an effective technique to improve the performance of data warehouses. Since cube operation represents the core of online analytical processing in data warehouses, it is a major challenge to develop efficient algorithms for computing cube on compressed data warehouses. To our knowledge, very few cube computation techniques have been proposed for compressed data warehouses to dat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IPSS: A Hybrid Approach to Planning and Scheduling Integration

    Publication Year: 2006 , Page(s): 1681 - 1695
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3397 KB) |  | HTML iconHTML  

    Recently, the areas of planning and scheduling in artificial intelligence (AI) have witnessed a big push toward their integration in order to solve complex problems. These problems require both reasoning on which actions are to be performed as well as their precedence constraints (planning) and the reasoning with respect to temporal constraints (e.g., duration, precedence, and deadline); those act... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approaches to Multisensor Data Fusion in Target Tracking: A Survey

    Publication Year: 2006 , Page(s): 1696 - 1710
    Cited by:  Papers (56)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (598 KB) |  | HTML iconHTML  

    The tracking of objects using distributed multiple sensors is an important field of work in the application areas of autonomous robotics, military applications, and mobile systems. In this survey, we review a number of computationally intelligent methods that are used for developing robust tracking schemes through sensor data fusion. The survey discusses the application of the various algorithms a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Overlay Subscription Network for Live Internet TV Broadcast

    Publication Year: 2006 , Page(s): 1711 - 1720
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1502 KB) |  | HTML iconHTML  

    We propose a framework, called overlay subscription network (OSN), for live Internet TV broadcast, where a subscriber can choose to watch at any time. This framework allows the source server to incrementally build a topology graph that contains the network connections not only from the server to each subscriber, but also among the subscribers themselves. With such a topology graph in place, we con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating Queries with Cardinality Constraints for DBMS Testing

    Publication Year: 2006 , Page(s): 1721 - 1725
    Cited by:  Papers (4)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (998 KB) |  | HTML iconHTML  

    Good testing coverage of novel database techniques, such as multidimensional histograms or changes in the execution engine, is a complex problem. In this work, we argue that this task requires generating query instances, not randomly, but based on a given set of constraints. Specifically, obtaining query instances that satisfy cardinality constraints on their subexpressions is an important challen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Join the IEEE Computer Society

    Publication Year: 2006 , Page(s): 1726
    Save to Project icon | Request Permissions | PDF file iconPDF (340 KB)  
    Freely Available from IEEE
  • Annual index

    Publication Year: 2006 , Page(s): Not in print
    Save to Project icon | Request Permissions | PDF file iconPDF (167 KB)  
    Freely Available from IEEE
  • TKDE Information for authors

    Publication Year: 2006 , Page(s): c3
    Save to Project icon | Request Permissions | PDF file iconPDF (94 KB)  
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2006 , Page(s): c4
    Save to Project icon | Request Permissions | PDF file iconPDF (155 KB)  
    Freely Available from IEEE

Aims & Scope

IEEE Transactions on Knowledge and Data Engineering (TKDE) informs researchers, developers, managers, strategic planners, users, and others interested in state-of-the-art and state-of-the-practice activities in the knowledge and data engineering area.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Jian Pei
Simon Fraser University

Associate Editor-in-Chief
Xuemin Lin
University of New South Wales

Associate Editor-in-Chief
Lei Chen
Hong Kong University of Science and Technology