By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 6 • June 2004

Filter Results

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

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

    Publication Year: 2004, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (57 KB)
    Freely Available from IEEE
  • Moving e-commerce with PIVOTS: private information viewing offering total safety

    Publication Year: 2004, Page(s):641 - 652
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB) | HTML iconHTML

    We present a technology which enables wide-scale deployment of a unique and powerful data access and search tool. This tool makes it possible for content owners on the Internet to offer end-users the ability to search, assess, or otherwise examine their nondisclosable private data. The end-users may use arbitrary, distrusted assessment algorithms and receive the results which are produced. These r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of R*-trees with arbitrary node extents

    Publication Year: 2004, Page(s):653 - 668
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1456 KB) | HTML iconHTML

    Existing analysis for R-trees is inadequate for several traditional and emerging applications including, for example, temporal, spatio-temporal, and multimedia databases because it is based on the assumption that the extents of a node are identical on all dimensions, which is not satisfied in these domains. We propose analytical models that can accurately predict R*-tree performance without this a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Skyline index for time series data

    Publication Year: 2004, Page(s):669 - 684
    Cited by:  Papers (21)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1416 KB) | HTML iconHTML

    We have developed a new indexing strategy that helps overcome the curse of dimensionality for time series data. Our proposed approach, called skyline index, adopts new skyline bounding regions (SBR) to approximate and represent a group of time series data according to their collective shape. Skyline bounding regions allow us to define a distance function that tightly lower bounds the distance betw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • THESUS, a closer view on Web content management enhanced with link semantics

    Publication Year: 2004, Page(s):685 - 700
    Cited by:  Papers (7)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1000 KB) | HTML iconHTML

    With the unstoppable growth of the world wide Web, the great success of Web search engines, such as Google and AltaVista, users now turn to the Web whenever looking for information. However, many users are neophytes when it comes to computer science, yet they are often specialists of a certain domain. These users would like to add more semantics to guide their search through world wide Web materia... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Steganographic schemes for file system and B-tree

    Publication Year: 2004, Page(s):701 - 713
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1440 KB) | HTML iconHTML

    While user access control and encryption can protect valuable data from passive observers, these techniques leave visible ciphertexts that are likely to alert an active adversary to the existence of the data. We introduce StegFD, a steganographic file driver that securely hides user-selected files in a file system so that, without the corresponding access keys, an attacker would not be able to ded... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dimensionality reduction and similarity computation by inner-product approximations

    Publication Year: 2004, Page(s):714 - 726
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1296 KB) | HTML iconHTML

    As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retrieval of multidimensional data. Both the dimensionality and the amount of data that needs to be processed are increasing rapidly. Reducing the dimension of the feature vectors to enhance the performance of the underlying tec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constrained cascade generalization of decision trees

    Publication Year: 2004, Page(s):727 - 739
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1616 KB) | HTML iconHTML

    While decision tree techniques have been widely used in classification applications, a shortcoming of many decision tree inducers is that they do not learn intermediate concepts, i.e., at each node, only one of the original features is involved in the branching decision. Combining other classification methods, which learn intermediate concepts, with decision tree inducers can produce more flexible... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On computing mobile agent routes for data fusion in distributed sensor networks

    Publication Year: 2004, Page(s):740 - 753
    Cited by:  Papers (132)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1496 KB) | HTML iconHTML

    The problem of computing a route for a mobile agent that incrementally fuses the data as it visits the nodes in a distributed sensor network is considered. The order of nodes visited along the route has a significant impact on the quality and cost of fused data, which, in turn, impacts the main objective of the sensor network, such as target classification or tracking. We present a simplified anal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Building a large and efficient hybrid peer-to-peer Internet caching system

    Publication Year: 2004, Page(s):754 - 769
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1560 KB) | HTML iconHTML

    Proxy hit ratios tend to decrease as the demand and supply of Web contents are becoming more diverse. By case studies, we quantitatively confirm this trend and observe significant document duplications among a proxy and its client browsers' caches. One reason behind this trend is that the client/server Web caching model does not support direct resource sharing among clients, causing the Web conten... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • NeC4.5: neural ensemble based C4.5

    Publication Year: 2004, Page(s):770 - 773
    Cited by:  Papers (49)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB) | HTML iconHTML

    Decision tree is with good comprehensibility while neural network ensemble is with strong generalization ability. These merits are integrated into a novel decision tree algorithm NeC4.5. This algorithm trains a neural network ensemble at first. Then, the trained ensemble is employed to generate a new training set through replacing the desired class labels of the original training examples with tho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data structure for association rule mining: T-trees and P-trees

    Publication Year: 2004, Page(s):774 - 778
    Cited by:  Papers (51)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB) | HTML iconHTML

    Two new structures for association rule mining (ARM), the T-tree, and the P-tree, together with associated algorithms, are described. The authors demonstrate that the structures and algorithms offer significant advantages in terms of storage and execution time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time series classification using Gaussian mixture models of reconstructed phase spaces

    Publication Year: 2004, Page(s):779 - 783
    Cited by:  Papers (60)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB) | HTML iconHTML

    A new signal classification approach is presented that is based upon modeling the dynamics of a system as they are captured in a reconstructed phase space. The modeling is done using full covariance Gaussian mixture models of time domain signatures, in contrast with current and previous work in signal classification that is typically focused on either linear systems analysis using frequency conten... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Call for Papers for Special Issue on Mining Biological Data

    Publication Year: 2004, Page(s): 784
    Request permission for commercial reuse | PDF file iconPDF (33 KB) | HTML iconHTML
    Freely Available from IEEE
  • TKDE Information for authors

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

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