By Topic

Knowledge and Data Engineering, IEEE Transactions on

Issue 8 • Date Aug. 2011

Filter Results

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

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

    Publication Year: 2011 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (156 KB)  
    Freely Available from IEEE
  • Guest Editors' Introduction to the Special Section on the 26th International Conference on Data Engineering

    Publication Year: 2011 , Page(s): 1121 - 1122
    Save to Project icon | Request Permissions | PDF file iconPDF (96 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Efficient Top-k Approximate Subtree Matching in Small Memory

    Publication Year: 2011 , Page(s): 1123 - 1137
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2364 KB) |  | HTML iconHTML  

    We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree within a large document tree using the canonical tree edit distance as a similarity measure between subtrees. Evaluating the tree edit distance for large XML trees is difficult: the best known algorithms have cubic runtime and quadratic space complexity, and, thus, do not scale. Our ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Usher: Improving Data Quality with Dynamic Forms

    Publication Year: 2011 , Page(s): 1138 - 1153
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1323 KB) |  | HTML iconHTML  

    Data quality is a critical problem in modern databases. data-entry forms present the first and arguably best opportunity for detecting and mitigating errors, but there has been little research into automatic methods for improving data quality at entry time. In this paper, we propose Usher, an end-to-end system for form design, entry, and data quality assurance. Using previous form submissions, Ush... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient and Accurate Discovery of Patterns in Sequence Data Sets

    Publication Year: 2011 , Page(s): 1154 - 1168
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1058 KB) |  | HTML iconHTML  

    Existing sequence mining algorithms mostly focus on mining for subsequences. However, a large class of applications, such as biological DNA and protein motif mining, require efficient mining of “approximate” patterns that are contiguous. The few existing algorithms that can be applied to find such contiguous approximate pattern mining have drawbacks like poor scalability, lack of gua... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Frequent Item Computation on a Chip

    Publication Year: 2011 , Page(s): 1169 - 1181
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1360 KB)  

    Computing frequent items is an important problem by itself and as a subroutine in several data mining algorithms. In this paper, we explore how to accelerate the computation of frequent items using field-programmable gate arrays (FPGAs) with a threefold goal: increase performance over existing solutions, reduce energy consumption over CPU-based systems, and explore the design space in detail as th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Continuous Monitoring of Distance-Based Range Queries

    Publication Year: 2011 , Page(s): 1182 - 1199
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1854 KB) |  | HTML iconHTML  

    Given a positive value r, a distance-based range query returns the objects that lie within the distance r of the query location. In this paper, we focus on the distance-based range queries that continuously change their locations in a euclidean space. We present an efficient and effective monitoring technique based on the concept of a safe zone. The safe zone of a query is the area with a property... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Differential Privacy via Wavelet Transforms

    Publication Year: 2011 , Page(s): 1200 - 1214
    Cited by:  Papers (5)
    Multimedia
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1207 KB) |  | HTML iconHTML  

    Privacy-preserving data publishing has attracted considerable research interest in recent years. Among the existing solutions, ∈-differential privacy provides the strongest privacy guarantee. Existing data publishing methods that achieve ∈-differential privacy, however, offer little data utility. In particular, if the output data set is used to answer count queries, the noise in the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monochromatic and Bichromatic Reverse Top-k Queries

    Publication Year: 2011 , Page(s): 1215 - 1229
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1819 KB) |  | HTML iconHTML  

    Nowadays, most applications return to the user a limited set of ranked results based on the individual user's preferences, which are commonly expressed through top-k queries. From the perspective of a manufacturer, it is imperative that her products appear in the highest ranked positions for many different user preferences, otherwise the product is not visible to potential customers. In this paper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy Time Series Forecasting Based on Pattern Sequence Similarity

    Publication Year: 2011 , Page(s): 1230 - 1243
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2020 KB) |  | HTML iconHTML  

    This paper presents a new approach to forecast the behavior of time series based on similarity of pattern sequences. First, clustering techniques are used with the aim of grouping and labeling the samples from a data set. Thus, the prediction of a data point is provided as follows: first, the pattern sequence prior to the day to be predicted is extracted. Then, this sequence is searched in the his... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integration of the HL7 Standard in a Multiagent System to Support Personalized Access to e-Health Services

    Publication Year: 2011 , Page(s): 1244 - 1260
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1012 KB) |  | HTML iconHTML  

    In this paper, we present a multiagent system to support patients in search of healthcare services in an e-health scenario. The proposed system is HL7-aware in that it represents both patient and service information according to the directives of HL7, the information management standard adopted in medical context. Our system builds a profile for each patient and uses it to detect Healthcare Servic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Making Aggregation Work in Uncertain and Probabilistic Databases

    Publication Year: 2011 , Page(s): 1261 - 1273
    Cited by:  Papers (5)
    Multimedia
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1253 KB)  

    We describe how aggregation is handled in the Trio system for uncertain and probabilistic data. Because “exact” aggregation in uncertain databases can produce exponentially sized results, we provide three alternatives: a low bound on the aggregate value, a high bound on the value, and the expected value. These variants return a single result instead of a set of possible results, and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comprehensive Citation Index for Research Networks

    Publication Year: 2011 , Page(s): 1274 - 1278
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (776 KB) |  | HTML iconHTML  

    The existing Science Citation Index only counts direct citations, whereas PageRank disregards the number of direct citations. We propose a new Comprehensive Citation Index (CCI) that evaluates both direct and indirect intellectual influence of research papers, and show that CCI is more reliable in discovering research papers with far-reaching influence. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stay Connected with the IEEE Computer Society [advertisement]

    Publication Year: 2011 , Page(s): 1279
    Save to Project icon | Request Permissions | PDF file iconPDF (297 KB)  
    Freely Available from IEEE
  • CPS Handles the Details for you [advertisement]

    Publication Year: 2011 , Page(s): 1280
    Save to Project icon | Request Permissions | PDF file iconPDF (190 KB)  
    Freely Available from IEEE
  • TKDE Information for authors

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

    Publication Year: 2011 , Page(s): c4
    Save to Project icon | Request Permissions | PDF file iconPDF (118 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