By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 5 • Date May 2007

Filter Results

Displaying Results 1 - 16 of 16
  • [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 (85 KB)
    Freely Available from IEEE
  • Practical Algorithms and Lower Bounds for Similarity Search in Massive Graphs

    Publication Year: 2007, Page(s):585 - 598
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1023 KB) | HTML iconHTML

    To exploit the similarity information hidden in the hyperlink structure of the Web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed architecture. The similarity of multistep neighborhoods of vertices are numerically evaluated by similarity functions including SimRank, a recursive refinement of cocitation, and PSimRank, a novel variant with better theo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Web Page Change Detection System Based on an Optimized Hungarian Algorithm

    Publication Year: 2007, Page(s):599 - 613
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5722 KB) | HTML iconHTML

    This paper describes an efficient Web page change detection system based on three optimizations that were implemented on top of the Hungarian algorithm, which we employ to compare trees that correspond to HTML Web pages. The optimizations attempt to stop the comparator algorithm that employs this O(n3) algorithm before it completes all its iterations based on criteria having to do with ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable Delivery of Dynamic Content Using a Cooperative Edge Cache Grid

    Publication Year: 2007, Page(s):614 - 630
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3223 KB) | HTML iconHTML

    In recent years, edge computing has emerged as a popular mechanism to deliver dynamic Web content to clients. However, many existing edge cache networks have not been able to harness the full potential of edge computing technology. In this paper, we argue and experimentally demonstrate that cooperation among the individual edge caches coupled with scalable server-driven document consistency mechan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conditional Anomaly Detection

    Publication Year: 2007, Page(s):631 - 645
    Cited by:  Papers (22)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (839 KB) | HTML iconHTML

    When anomaly detection software is used as a data analysis tool, finding the hardest-to-detect anomalies is not the most critical task. Rather, it is often more important to make sure that those anomalies that are reported to the user are in fact interesting. If too many unremarkable data points are returned to the user labeled as candidate anomalies, the software can soon fall into disuse. One wa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probe Minimization by Schedule Optimization: Supporting Top-K Queries with Expensive Predicates

    Publication Year: 2007, Page(s):646 - 662
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2062 KB) | HTML iconHTML

    This paper addresses the problem of evaluating ranked top-k queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries, we believe such support for ranked queries can be even more important: first, ranked queries often need to model user-specific concepts of preference, relevance, or similarity, which call for dynamic user-defined functi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Indexing Spatio-Temporal Trajectories with Efficient Polynomial Approximations

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

    Complex queries on trajectory data are increasingly common in applications involving moving objects. MBR or grid-cell approximations on trajectories perform suboptimally since they do not capture the smoothness and lack of internal area of trajectories. We describe a parametric space indexing method for historical trajectory data, approximating a sequence of movement functions with single continuo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiquality Data Replication in Multimedia Databases

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

    In contrast to other database applications, multimedia data can have a wide range of quality parameters, such as spatial and temporal resolution and compression format. Users can request data with specific quality requirements due to the needs of their application or the limitations of their resources. The database can support multiple qualities by converting data from the original (high) quality ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bayesian Networks for Knowledge-Based Authentication

    Publication Year: 2007, Page(s):695 - 710
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2642 KB) | HTML iconHTML

    Knowledge-based authentication (KBA) has gained prominence as a user authentication method for electronic transactions. This paper presents a Bayesian network model of KBA grounded in probabilistic reasoning and information theory. The probabilistic semantics of the model parameters naturally lead to the definitions of two key KBA metrics??guessability and memorability. The statistical modeling ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Anonymizing Classification Data for Privacy Preservation

    Publication Year: 2007, Page(s):711 - 725
    Cited by:  Papers (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2379 KB) | HTML iconHTML

    Classification is a fundamental problem in data analysis. Training a classifier requires accessing a large collection of data. Releasing person-specific data, such as customer data or patient records, may pose a threat to an individual's privacy. Even after removing explicit identifying information such as Name and SSN, it is still possible to link released records back to their identities by matc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • In this issue - Technically

    Publication Year: 2007, Page(s): 726
    Request permission for commercial reuse | PDF file iconPDF (180 KB)
    Freely Available from IEEE
  • Join the IEEE Computer Society

    Publication Year: 2007, Page(s): 727
    Request permission for commercial reuse | PDF file iconPDF (105 KB)
    Freely Available from IEEE
  • Access the IEEE Computer Society Digital Library [advertisement]

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

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