By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 8 • Date Aug. 2007

Filter Results

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

    Publication Year: 2007, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (108 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
  • Toward Exploratory Test-Instance-Centered Diagnosis in High-Dimensional Classification

    Publication Year: 2007, Page(s):1001 - 1015
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5306 KB) | HTML iconHTML

    High-dimensional data is a difficult case for most subspace-based classification methods because of the large number of combinations of dimensions, which have discriminatory power. This is because there are an exponential number of combinations of dimensions that could decide the correct class instance, and this combination could vary with data locality and test instance. Therefore, most summarize... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hot Topic Extraction Based on Timeline Analysis and Multidimensional Sentence Modeling

    Publication Year: 2007, Page(s):1016 - 1025
    Cited by:  Papers (37)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2756 KB) | HTML iconHTML

    With the vast amount of digitized textual materials now available on the Internet, it is almost impossible for people to absorb all pertinent information in a timely manner. To alleviate the problem, we present a novel approach for extracting hot topics from disparate sets of textual documents published in a given time period. Our technique consists of two steps. First, hot terms are extracted by ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Entropy Weighting k-Means Algorithm for Subspace Clustering of High-Dimensional Sparse Data

    Publication Year: 2007, Page(s):1026 - 1041
    Cited by:  Papers (115)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4555 KB) | HTML iconHTML

    This paper presents a new k-means type algorithm for clustering high-dimensional objects in sub-spaces. In high-dimensional data, clusters of objects often exist in subspaces rather than in the entire space. For example, in text clustering, clusters of documents of different topics are categorized by different subsets of terms or keywords. The keywords for one cluster may not occur in the document... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Frequent Closed Sequence Mining without Candidate Maintenance

    Publication Year: 2007, Page(s):1042 - 1056
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3646 KB) | HTML iconHTML

    Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter leads to not only a more compact yet complete result set but also better efficiency. However, most of the previously developed closed pattern mining algorithms work under the candidate maintenance-and- test paradigm, which i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maintaining Strong Cache Consistency for the Domain Name System

    Publication Year: 2007, Page(s):1057 - 1071
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3127 KB) | HTML iconHTML

    Effective caching in the domain name system (DNS) is critical to its performance and scalability. Existing DNS only supports weak cache consistency by using the time-to-live (TTL) mechanism, which functions reasonably well in normal situations. However, maintaining strong cache consistency in DNS as an indispensable exceptional handling mechanism has become more and more demanding for three import... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Skyline and Top-k Retrieval in Subspaces

    Publication Year: 2007, Page(s):1072 - 1088
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5388 KB) | HTML iconHTML

    Skyline and top-k queries are two popular operations for preference retrieval. In practice, applications that require these operations usually provide numerous candidate attributes, whereas, depending on their interests, users may issue queries regarding different subsets of the dimensions. The existing algorithms are inadequate for subspace skyline/top-k search because they have at least one of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Method for Estimating the Precision of Placename Matching

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

    Information in digital libraries and information systems frequently refers to locations or objects in geographic space. Digital gazetteers are commonly employed to match the referred placenames with actual locations in information integration and data cleaning procedures. This process may fail due to missing information in the gazetteer, multiple matches, or false positive matches. We have analyze... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Family of Directional Relation Models for Extended Objects

    Publication Year: 2007, Page(s):1116 - 1130
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2861 KB) | HTML iconHTML

    In this paper, we introduce a family of expressive models for qualitative spatial reasoning with directions. The proposed family is based on the cognitive plausible cone-based model. We formally define the directional relations that can be expressed in each model of the family. Then, we use our formal framework to study two interesting problems: computing the inverse of a directional relation and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Three Types of Covering-Based Rough Sets

    Publication Year: 2007, Page(s):1131 - 1144
    Cited by:  Papers (108)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB) | HTML iconHTML

    Rough set theory is a useful tool for data mining. It is based on equivalence relations and has been extended to covering-based generalized rough set. This paper studies three kinds of covering generalized rough sets for dealing with the vagueness and granularity in information systems. First, we examine the properties of approximation operations generated by a covering in comparison with those of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Localized Outlying and Boundary Data Detection in Sensor Networks

    Publication Year: 2007, Page(s):1145 - 1157
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2297 KB)

    This paper targets the identification of outlying sensors (that is, outlying reading sensors) and the detection of the reach of events in sensor networks. Typical applications include the detection of the transportation front line of some vegetation or animalcule's growth over a certain geographical region. We propose and analyze two novel algorithms for outlying sensor identification and event bo... 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, Page(s):1158 - 1160
    Request permission for commercial reuse | PDF file iconPDF (356 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 (108 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