By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 8 • Date Aug. 2006

Filter Results

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

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

    Publication Year: 2006, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (98 KB)
    Freely Available from IEEE
  • Unsupervised selection of a finite Dirichlet mixture model: an MML-based approach

    Publication Year: 2006, Page(s):993 - 1009
    Cited by:  Papers (55)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5427 KB) | HTML iconHTML

    This paper proposes an unsupervised algorithm for learning a finite Dirichlet mixture model. An important part of the unsupervised learning problem is determining the number of clusters which best describe the data. We extend the minimum message length (MML) principle to determine the number of clusters in the case of Dirichlet mixtures. Parameter estimation is done by the expectation-maximization... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discovering expressive process models by clustering log traces

    Publication Year: 2006, Page(s):1010 - 1027
    Cited by:  Papers (39)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3667 KB) | HTML iconHTML

    Process mining techniques have recently received notable attention in the literature; for their ability to assist in the (re)design of complex processes by automatically discovering models that explain the events registered in some log traces provided as input. Following this line of research, the paper investigates an extension of such basic approaches, where the identification of different varia... View full abstract»

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

    Publication Year: 2006, Page(s):1028 - 1042
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4461 KB) | HTML iconHTML

    This paper introduces orthogonal decision trees that offer an effective way to construct a redundancy-free, accurate, and meaningful representation of large decision-tree-ensembles often created by popular techniques such as bagging, boosting, random forests, and many distributed and data stream mining algorithms. Orthogonal decision trees are functionally orthogonal to each other and they corresp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust rule-based prediction

    Publication Year: 2006, Page(s):1043 - 1054
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1647 KB) | HTML iconHTML

    This paper studies a problem of robust rule-based classification, i.e., making predictions in the presence of missing values in data. This study differs from other missing value handling research in that it does not handle missing values but builds a rule-based classification model to tolerate missing values. Based on a commonly used rule-based classification model, we characterize the robustness ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Test strategies for cost-sensitive decision trees

    Publication Year: 2006, Page(s):1055 - 1067
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4721 KB) | HTML iconHTML

    In medical diagnosis, doctors must often determine what medical tests (e.g., X-ray and blood tests) should be ordered for a patient to minimize the total cost of medical tests and misdiagnosis. In this paper, we design cost-sensitive machine learning algorithms to model this learning and diagnosis process. Medical tests are like attributes in machine learning whose values may be obtained at a cost... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A compensation-based approach for view maintenance in distributed environments

    Publication Year: 2006, Page(s):1068 - 1081
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1832 KB) | HTML iconHTML

    Data integration over multiple heterogeneous data sources has become increasingly important for modern applications. The integrated data is usually stored as materialized views to allow better access, performance, and high availability. In loosely coupled environments, such as the data grid, the data sources are autonomous. Hence, tie source updates can be concurrent and cause erroneous results du... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating compact redundancy-free XML documents from conceptual-model hypergraphs

    Publication Year: 2006, Page(s):1082 - 1096
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1162 KB) | HTML iconHTML

    As XML data becomes more and more prevalent and as larger quantities of data find their way into XML documents, the need for quality XML data organization only increase. One standard way of structuring data well is to reduce and, if possible, eliminate redundancy, while at the same time making the storage structures as compact as possible. In this paper, we present a methodology to generate XML st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quality of service guarantee for temporal consistency of real-time transactions

    Publication Year: 2006, Page(s):1097 - 1110
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2778 KB) | HTML iconHTML

    The more-less (ML) scheme has been shown to be an efficient approach for maintaining temporal consistency of real-time data objects. Although ML provides a deterministic guarantee in temporal consistency, the number of update transactions that can be supported in a system is limited. This is due to its use of the worst-case computation time in deriving deadlines and periods of update transactions.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An energy-efficient and access latency optimized indexing scheme for wireless data broadcast

    Publication Year: 2006, Page(s):1111 - 1124
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1618 KB) | HTML iconHTML

    Data broadcast is an attractive data dissemination method in mobile environments. To improve energy efficiency, existing air indexing schemes for data broadcast have focused on reducing tuning time only, i.e., the duration that a mobile client stays active in data accesses. On the other hand, existing broadcast scheduling schemes have aimed at reducing access latency through nonflat data broadcast... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transparent decision support using statistical reasoning and fuzzy inference

    Publication Year: 2006, Page(s):1125 - 1137
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3269 KB) | HTML iconHTML

    A framework for the development of a decision support system (DSS) that exhibits uncommonly transparent rule-based inference logic is introduced. A DSS is constructed by marrying a statistically based fuzzy inference system (FIS) with a user interface, allowing drill-down exploration of the underlying statistical support, providing transparent access to both the rule-based inference as well as the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sentence similarity based on semantic nets and corpus statistics

    Publication Year: 2006, Page(s):1138 - 1150
    Cited by:  Papers (132)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1886 KB) | HTML iconHTML

    Sentence similarity measures play an increasingly important role in text-related research and applications in areas such as text mining, Web page retrieval, and dialogue systems. Existing methods for computing sentence similarity have been adopted from approaches used for long text documents. These methods process sentences in a very high-dimensional space and are consequently inefficient, require... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Computer Society celebrates two 60-year anniversaries

    Publication Year: 2006, Page(s): 1151
    Request permission for commercial reuse | PDF file iconPDF (104 KB)
    Freely Available from IEEE
  • From the IEEE Computer Society - ReadyNotes

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

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

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