By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 7 • Date July 2007

Filter Results

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

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

    Publication Year: 2007, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (83 KB)
    Freely Available from IEEE
  • The Concentration of Fractional Distances

    Publication Year: 2007, Page(s):873 - 886
    Cited by:  Papers (69)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1115 KB) | HTML iconHTML

    Nearest neighbor search and many other numerical data analysis tools most often rely on the use of the euclidean distance. When data are high dimensional, however, the euclidean distances seem to concentrate; all distances between pairs of data elements seem to be very similar. Therefore, the relevance of the euclidean distance has been questioned in the past, and fractional norms (Minkowski-like ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhancing the Effectiveness of Clustering with Spectra Analysis

    Publication Year: 2007, Page(s):887 - 902
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2423 KB) | HTML iconHTML

    For many clustering algorithms, such as K-Means, EM, and CLOPE, there is usually a requirement to set some parameters. Often, these parameters directly or indirectly control the number of clusters, that is, k, to return. In the presence of different data characteristics and analysis contexts, it is often difficult for the user to estimate the number of clusters in the data set. This is especially ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Computation of Iceberg Cubes by Bounding Aggregate Functions

    Publication Year: 2007, Page(s):903 - 918
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2746 KB) | HTML iconHTML

    The iceberg cubing problem is to compute the multidimensional group-by partitions that satisfy given aggregation constraints. Pruning unproductive computation for iceberg cubing when nonantimonotone constraints are present is a great challenge because the aggregate functions do not increase or decrease monotonically along the subset relationship between partitions. In this paper, we propose a nove... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Approximate Query Processing in Peer-to-Peer Networks

    Publication Year: 2007, Page(s):919 - 933
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2366 KB) | HTML iconHTML

    Peer-to-peer (P2P) databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large-scale ad hoc analysis queries, for example, aggregation queries, on these databases poses unique challenges. Exact solutions can be time consuming and difficult to implement, given the distributed and dynamic nature of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SPEX: Streamed and Progressive Evaluation of XPath

    Publication Year: 2007, Page(s):934 - 949
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2178 KB) | HTML iconHTML

    Streams are preferable over data stored in memory in contexts where data is too large or volatile, or a standard approach to data processing based on storing is too time or space consuming. Emerging applications such as publish-subscribe systems, data monitoring in sensor networks, financial and traffic monitoring, and routing of MPEG-7 call for querying streams. In many such applications, XML str... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Monitoring Algorithm for Fast News Alerts

    Publication Year: 2007, Page(s):950 - 961
    Cited by:  Papers (17)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2050 KB) | HTML iconHTML

    Recently, there has been a dramatic increase in the use of XML data to deliver information over the Web. Personal Weblogs, news Web sites, and discussion forums are now publishing RSS feeds for their subscribers to retrieve new postings. As the popularity of personal Weblogs and RSS feeds grows rapidly, RSS aggregation services and blog search engines have appeared, which try to provide a central ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Top-k Monitoring in Wireless Sensor Networks

    Publication Year: 2007, Page(s):962 - 976
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3044 KB) | HTML iconHTML

    Top-k monitoring is important to many wireless sensor applications. This paper exploits the semantics of top-k query and proposes an energy-efficient monitoring approach called FILA. The basic idea is to install a filter at each sensor node to suppress unnecessary sensor updates. Filter setting and query reevaluation upon updates are two fundamental issues to the correctness and efficiency of the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discovering and Exploiting Causal Dependencies for Robust Mobile Context-Aware Recommenders

    Publication Year: 2007, Page(s):977 - 992
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2496 KB) | HTML iconHTML

    Acquisition of context poses unique challenges to mobile context-aware recommender systems. The limited resources in these systems make minimizing their context acquisition a practical need, and the uncertainty in the mobile environment makes missing and erroneous context inputs a major concern. In this paper, we propose an approach based on Bayesian networks (BNs) for building recommender systems... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Note on Linear Time Algorithms for Maximum Error Histograms

    Publication Year: 2007, Page(s):993 - 997
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (762 KB) | HTML iconHTML

    Histograms and Wavelet synopses provide useful tools in query optimization and approximate query answering. Traditional histogram construction algorithms, e.g., V-Optimal, use error measures which are the sums of a suitable function, e.g., square, of the error at each point. Although the best-known algorithms for solving these problems run in quadratic time, a sequence of results have given us a l... 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: 2007
    Request permission for commercial reuse | PDF file iconPDF (340 KB)
    Freely Available from IEEE
  • TKDE Information for authors

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

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