By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 5 • Date May 2009

Filter Results

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

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

    Publication Year: 2009, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (78 KB)
    Freely Available from IEEE
  • A Survey of Uncertain Data Algorithms and Applications

    Publication Year: 2009, Page(s):609 - 623
    Cited by:  Papers (111)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (641 KB) | HTML iconHTML

    In recent years, a number of indirect data collection methodologies have lead to the proliferation of uncertain data. Such data points are often represented in the form of a probabilistic function, since the corresponding deterministic value is not known. This increases the challenge of mining and managing uncertain data, since the precise behavior of the underlying data is no longer known. In thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adapted One-versus-All Decision Trees for Data Stream Classification

    Publication Year: 2009, Page(s):624 - 637
    Cited by:  Papers (26)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4172 KB) | HTML iconHTML

    One versus all (OVA) decision trees learn k individual binary classifiers, each one to distinguish the instances of a single class from the instances of all other classes. Thus OVA is different from existing data stream classification schemes whose majority use multiclass classifiers, each one to discriminate among all the classes. This paper advocates some outstanding advantages of OVA for data s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bayes Vector Quantizer for Class-Imbalance Problem

    Publication Year: 2009, Page(s):638 - 651
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4360 KB) | HTML iconHTML

    The class-imbalance problem is the problem of learning a classification rule from data that are skewed in favor of one class. On these datasets traditional learning techniques tend to overlook the less numerous class, at the advantage of the majority class. However, the minority class is often the most interesting one for the task at hand. For this reason, the class-imbalance problem has received ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Catching the Trend: A Framework for Clustering Concept-Drifting Categorical Data

    Publication Year: 2009, Page(s):652 - 665
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2934 KB) | HTML iconHTML

    Sampling has been recognized as an important technique to improve the efficiency of clustering. However, with sampling applied, those points that are not sampled will not have their labels after the normal process. Although there is a straightforward approach in the numerical domain, the problem of how to allocate those unlabeled data points into proper clusters remains as a challenging issue in t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GridVideo: A Practical Example of Nonscientific Application on the Grid

    Publication Year: 2009, Page(s):666 - 680
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2242 KB) | HTML iconHTML Multimedia Media

    Starting from 1990s and until now, Grid computing has been mainly used in scientific laboratories. Only in the last few years, it is evolving into a business-innovating technology that is driving commercial adoption. In this paper, we describe GridVideo, a Grid-based multimedia application for the distributed tailoring and streaming of media files. The objective is to show, starting from a real ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchically Distributed Peer-to-Peer Document Clustering and Cluster Summarization

    Publication Year: 2009, Page(s):681 - 698
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3539 KB) | HTML iconHTML

    In distributed data mining, adopting a flat node distribution model can affect scalability. To address the problem of modularity, flexibility and scalability, we propose a Hierarchically-distributed Peer-to-Peer (HP2PC) architecture and clustering algorithm. The architecture is based on a multi-layer overlay network of peer neighborhoods. Supernodes, which act as representatives of neighborhoods, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact Knowledge Hiding through Database Extension

    Publication Year: 2009, Page(s):699 - 713
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1949 KB) | HTML iconHTML

    In this paper, we propose a novel, exact border-based approach that provides an optimal solution for the hiding of sensitive frequent itemsets by (i) minimally extending the original database by a synthetically generated database part - the database extension, (ii) formulating the creation of the database extension as a constraint satisfaction problem, (iii) mapping the constraint satisfaction pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GLIP: A Concurrency Control Protocol for Clipping Indexing

    Publication Year: 2009, Page(s):714 - 728
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4172 KB) | HTML iconHTML

    Multidimensional databases are beginning to be used in a wide range of applications. To meet this fast-growing demand, the R-tree family is being applied to support fast access to multidimensional data, for which the R+-tree exhibits outstanding search performance. In order to support efficient concurrent access in multiuser environments, concurrency control mechanisms for multidimensional indexin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Query Point Movement Techniques for Large CBIR Systems

    Publication Year: 2009, Page(s):729 - 743
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3444 KB) | HTML iconHTML

    Target search in content-based image retrieval (CBIR) systems refers to finding a specific (target) image such as a particular registered logo or a specific historical photograph. Existing techniques, designed around query refinement based on relevance feedback, suffer from slow convergence, and do not guarantee to find intended targets. To address these limitations, we propose several efficient q... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Schema Vacuuming in Temporal Databases

    Publication Year: 2009, Page(s):744 - 747
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB) | HTML iconHTML

    Temporal databases facilitate the support of historical information by providing functions for indicating the intervals during which a tuple was applicable (along one or more temporal dimensions). Because data are never deleted, only superceded, temporal databases are inherently append-only resulting, over time, in a large historical sequence of database states. Data vacuuming in temporal database... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Subgraph Similarity Problem

    Publication Year: 2009, Page(s):748 - 749
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (126 KB) | HTML iconHTML

    Similarity is a well known weakening of bisimilarity where one system is required to simulate the other and vice versa. It has been shown that the subgraph bisimilarity problem, a variation of the subgraph isomorphism problem where isomorphism is weakened to bisimilarity, is NP-complete. We show that the subgraph similarity problem and some related variations thereof still remain NP-complete. View full abstract»

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

    Publication Year: 2009, Page(s):750 - 752
    Request permission for commercial reuse | PDF file iconPDF (226 KB)
    Freely Available from IEEE
  • TKDE Information for authors

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

    Publication Year: 2009, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (141 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