By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 7 • Date July 2005

Filter Results

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

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

    Publication Year: 2005, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (684 KB)
    Freely Available from IEEE
  • Periodicity detection in time series databases

    Publication Year: 2005, Page(s):875 - 887
    Cited by:  Papers (55)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1248 KB) | HTML iconHTML

    Periodicity mining is used for predicting trends in time series data. Discovering the rate at which the time series is periodic has always been an obstacle for fully automated periodicity mining. Existing periodicity mining algorithms assume that the periodicity, rate (or simply the period) is user-specified. This assumption is a considerable limitation, especially in time series data where the pe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ADMiRe: an algebraic data mining approach to system performance analysis

    Publication Year: 2005, Page(s):888 - 901
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (992 KB) | HTML iconHTML

    Performance analysis of computing systems is an increasingly difficult task due to growing system complexity. Traditional tools rely on ad hoc procedures. With these, determining which of the manifold system and workload parameters to examine is often a lengthy and highly speculative process. The analysis is often incomplete and, therefore, prone to revealing faulty conclusions and not uncovering ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum spanning tree partitioning algorithm for microaggregation

    Publication Year: 2005, Page(s):902 - 911
    Cited by:  Papers (78)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB) | HTML iconHTML

    This paper presents a clustering algorithm for partitioning a minimum spanning tree with a constraint on minimum group size. The problem is motivated by microaggregation, a disclosure limitation technique in which similar records are aggregated into groups containing a minimum of k records. Heuristic clustering methods are needed since the minimum information loss microaggregation problem is NP-ha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rights protection for categorical data

    Publication Year: 2005, Page(s):912 - 926
    Cited by:  Papers (15)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1432 KB) | HTML iconHTML

    A novel method of rights protection for categorical data through watermarking is introduced in this paper. New watermark embedding channels are discovered and associated novel watermark encoding algorithms are proposed. While preserving data quality requirements, the introduced solution is designed to survive important attacks, such as subset selection and random alterations. Mark detection is ful... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Domain-driven data synopses for dynamic quantiles

    Publication Year: 2005, Page(s):927 - 938
    Cited by:  Papers (3)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB) | HTML iconHTML

    In this paper, we present new algorithms for dynamically computing quantiles of a relation subject to insert as well as delete operations. At the core of our algorithms lies a small-space multiresolution representation of the underlying data distribution based on random subset sums or RSSs. These RSSs are updated with every insert and delete operation. When quantiles are demanded, we use these RSS... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integration and efficient lookup of compressed XML accessibility maps

    Publication Year: 2005, Page(s):939 - 953
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB) | HTML iconHTML

    XML is emerging as a useful platform-independent data representation language. As more and more XML data is shared across data sources, it becomes important to consider the issue of XML access control. One promising approach to store the accessibility information is based on the CAM (compressed accessibility map). We make two advancements in this direction: 1) Previous work suggests that for each ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multilevel composability model for semantic Web services

    Publication Year: 2005, Page(s):954 - 968
    Cited by:  Papers (73)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1424 KB) | HTML iconHTML

    We propose a composability model to ascertain that Web services can safely be combined, hence avoiding unexpected failures at runtime. Composability is checked through a set of rules organized into four levels, syntactic, static semantic, dynamic semantic, and qualitative levels. We introduce the concepts of composability degree and τ-composability to cater for partial and total composability.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experimentation with local consensus ontologies with implications for automated service composition

    Publication Year: 2005, Page(s):969 - 981
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1408 KB) | HTML iconHTML

    Agent technologies represent a promising approach for the integration of interorganizational capabilities across distributed, networked environments. However, knowledge sharing interoperability problems can arise when agents incorporating differing ontologies try to synchronize their internal information. Moreover, in practice, agents may not have a common or global consensus ontology that will fa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query processing in a mobile computing environment: exploiting the features of asymmetry

    Publication Year: 2005, Page(s):982 - 996
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1056 KB) | HTML iconHTML

    With the cutting edge technology advance in wireless and mobile computers, the query processing in a mobile environment involves join processing among different sites, which include static servers and mobile computers. Because of the need for energy saving and also the presence of asymmetric features in a mobile computing environment, the conventional query processing for a distributed database ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Indexing useful structural patterns for XML query processing

    Publication Year: 2005, Page(s):997 - 1009
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1320 KB) | HTML iconHTML

    Queries on semistructured data are hard to process due to the complex nature of the data and call for specialized techniques. Existing path-based indexes and query processing algorithms are not efficient for searching complex structures beyond simple paths, even when the queries are high-selective. We introduce the definition of minimal infrequent structures (MIS), which are structures that 1) exi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A tree-based forward digest protocol to verify data integrity in distributed media streaming

    Publication Year: 2005, Page(s):1010 - 1014
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB) | HTML iconHTML

    We design a tree-based forward digest protocol (TFDP) to verify data integrity in distributed media streaming for content distribution. Several challenges arise, including the timing constraint of streaming sessions, the involvement of multiple senders, and the untrustworthiness of these senders. A comprehensive comparison is presented on the performance of existing protocols and TFDP, with respec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On embedding machine-processable semantics into documents

    Publication Year: 2005, Page(s):1014 - 1018
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB) | HTML iconHTML

    Most Web and legacy paper-based documents are available in human comprehensible text form, not readily accessible to or understood by computer programs. Here, we investigate an approach to amalgamate XML technology with programming languages for representational purposes that can enhance traceability, thereby facilitating semiautomatic extraction and update. Specifically, we propose a modular tech... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • [Back inside cover]

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

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