IEEE Transactions on Knowledge and Data Engineering

Issue 3 • March 2011

Filter Results

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

    Publication Year: 2011, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (184 KB)
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2011, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (236 KB)
    Freely Available from IEEE
  • A Fast Multiple Longest Common Subsequence (MLCS) Algorithm

    Publication Year: 2011, Page(s):321 - 334
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3773 KB) | HTML iconHTML

    Finding the longest common subsequence (LCS) of multiple strings is an NP-hard problem, with many applications in the areas of bioinformatics and computational genomics. Although significant efforts have been made to address the problem and its special cases, the increasing complexity and size of biological data require more efficient methods applicable to an arbitrary number of strings. In this p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fuzzy Self-Constructing Feature Clustering Algorithm for Text Classification

    Publication Year: 2011, Page(s):335 - 349
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5306 KB) | HTML iconHTML

    Feature clustering is a powerful method to reduce the dimensionality of feature vectors for text classification. In this paper, we propose a fuzzy similarity-based self-constructing algorithm for feature clustering. The words in the feature vector of a document set are grouped into clusters, based on similarity test. Words that are similar to each other are grouped into the same cluster. Each clus... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Generic Multilevel Architecture for Time Series Prediction

    Publication Year: 2011, Page(s):350 - 359
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1767 KB) | HTML iconHTML

    Rapidly evolving businesses generate massive amounts of time-stamped data sequences and cause a demand for both univariate and multivariate time series forecasting. For such data, traditional predictive models based on autoregression are often not sufficient to capture complex nonlinear relationships between multidimensional features and the time series outputs. In order to exploit these relations... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Relevance Feedback for Content-Based Image Retrieval by Mining User Navigation Patterns

    Publication Year: 2011, Page(s):360 - 372
    Cited by:  Papers (58)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4089 KB) | HTML iconHTML

    Nowadays, content-based image retrieval (CBIR) is the mainstay of image retrieval systems. To be more profitable, relevance feedback techniques were incorporated into CBIR such that more precise results can be obtained by taking user's feedbacks into account. However, existing relevance feedback-based CBIR methods usually request a number of iterative feedbacks to produce refined search results, e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Techniques for Online Record Linkage

    Publication Year: 2011, Page(s):373 - 387
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2637 KB) | HTML iconHTML

    The need to consolidate the information contained in heterogeneous data sources has been widely documented in recent years. In order to accomplish this goal, an organization must resolve several types of heterogeneity problems, especially the entity heterogeneity problem that arises when the same real-world entity type is represented using different identifiers in different data sources. Statistic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experience Transfer for the Configuration Tuning in Large-Scale Computing Systems

    Publication Year: 2011, Page(s):388 - 401
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2301 KB) | HTML iconHTML

    This paper proposes a new strategy, the experience transfer, to facilitate the management of large-scale computing systems. It deals with the utilization of management experiences in one system (or previous systems) to benefit the same management task in other systems (or current systems). We use the system configuration tuning as a case application to demonstrate all procedures involved in the ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extended XML Tree Pattern Matching: Theories and Algorithms

    Publication Year: 2011, Page(s):402 - 416
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2472 KB) | HTML iconHTML

    As business and enterprises generate and exchange XML data more often, there is an increasing need for efficient processing of queries on XML data. Searching for the occurrences of a tree pattern query in an XML database is a core operation in XML query processing. Prior works demonstrate that holistic twig pattern matching algorithm is an efficient technique to answer an XML tree pattern with par... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing Resource Conflicts in Workflow Management Systems

    Publication Year: 2011, Page(s):417 - 432
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (979 KB) | HTML iconHTML

    Resource allocation and scheduling are fundamental issues in a Workflow Management System (WfMS). Effective resource management in WfMS should examine resource allocation together with task scheduling since these problems impose mutual constraints. Optimization of the one factor is subject to the other constraints and vice versa. Thus, an ideal algorithm should take into account not only performan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ranking Spatial Data by Quality Preferences

    Publication Year: 2011, Page(s):433 - 446
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2296 KB) | HTML iconHTML

    A spatial preference query ranks objects based on the qualities of features in their spatial neighborhood. For example, using a real estate agency database of flats for lease, a customer may want to rank the flats with respect to the appropriateness of their location, defined after aggregating the qualities of other features (e.g., restaurants, cafes, hospital, market, etc.) within their spatial n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Selecting Attributes for Sentiment Classification Using Feature Relation Networks

    Publication Year: 2011, Page(s):447 - 462
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (8275 KB) | HTML iconHTML

    A major concern when incorporating large sets of diverse n-gram features for sentiment classification is the presence of noisy, irrelevant, and redundant attributes. These concerns can often make it difficult to harness the augmented discriminatory potential of extended feature sets. We propose a rule-based multivariate text feature selection method called Feature Relation Network (FRN) that consi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The CoQUOS Approach to Continuous Queries in Unstructured Overlays

    Publication Year: 2011, Page(s):463 - 478
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1761 KB) | HTML iconHTML

    The current peer-to-peer (P2P) content distribution systems are constricted by their simple on-demand content discovery mechanism. The utility of these systems can be greatly enhanced by incorporating two capabilities, namely a mechanism through which peers can register their long term interests with the network so that they can be continuously notified of new data items, and a means for the peers... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE and IEEE Computer Society Special Student Offer

    Publication Year: 2011, Page(s): 479
    Request permission for commercial reuse | PDF file iconPDF (468 KB)
    Freely Available from IEEE
  • IEEE Computer Society - Stay Connected [advertisement]

    Publication Year: 2011, Page(s): 480
    Request permission for commercial reuse | PDF file iconPDF (297 KB)
    Freely Available from IEEE
  • TKDE Information for authors

    Publication Year: 2011, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (236 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2011, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (184 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
Xuemin Lin
University of New South Wales

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