IEEE Transactions on Knowledge and Data Engineering

Issue 1 • Jan. 2008

Filter Results

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

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

    Publication Year: 2008, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (81 KB)
    Freely Available from IEEE
  • SRDA: An Efficient Algorithm for Large-Scale Discriminant Analysis

    Publication Year: 2008, Page(s):1 - 12
    Cited by:  Papers (170)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2439 KB) | HTML iconHTML

    Linear Discriminant Analysis (LDA) has been a popular method for extracting features that preserves class separability. The projection functions of LDA are commonly obtained by maximizing the between-class covariance and simultaneously minimizing the within-class covariance. It has been widely used in many fields of information processing, such as machine learning, data mining, information retriev... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monitoring High-Dimensional Data for Failure Detection and Localization in Large-Scale Computing Systems

    Publication Year: 2008, Page(s):13 - 25
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2025 KB) | HTML iconHTML

    It is a major challenge to process high-dimensional measurements for failure detection and localization in large-scale computing systems. However, it is observed that in information systems, those measurements are usually located in a low-dimensional structure that is embedded in the high-dimensional space. From this perspective, a novel approach is proposed to model the geometry of underlying dat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Neural-Based Learning Classifier Systems

    Publication Year: 2008, Page(s):26 - 39
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3031 KB)

    UCS is a supervised learning classifier system that was introduced in 2003 for classification in data mining tasks. The representation of a rule in UCS as a univariate classification rule is straightforward for a human to understand. However, the system may require a large number of rules to cover the input space. Artificial neural networks (NNs), on the other hand, normally provide a more compact... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Similarity Search over Future Stream Time Series

    Publication Year: 2008, Page(s):40 - 54
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2716 KB) | HTML iconHTML

    With the advance of hardware and communication technologies, stream time series is gaining ever-increasing attention due to its importance in many applications such as financial data processing, network monitoring, Web click-stream analysis, sensor data mining, and anomaly detection. For all of these applications, an efficient and effective similarity search over stream data is essential. Because ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Label Propagation through Linear Neighborhoods

    Publication Year: 2008, Page(s):55 - 67
    Cited by:  Papers (165)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3636 KB) | HTML iconHTML

    In many practical data mining applications such as text classification, unlabeled training examples are readily available, but labeled ones are fairly expensive to obtain. Therefore, semi supervised learning algorithms have aroused considerable interests from the data mining and machine learning fields. In recent years, graph-based semi supervised learning has been becoming one of the most active ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discovering Frequent Agreement Subtrees from Phylogenetic Data

    Publication Year: 2008, Page(s):68 - 82
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2212 KB) | HTML iconHTML

    We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unordered tree in which the order among siblings is unimportant. Furthermore, each leaf in the tree has a label representing a taxon (species or organism) name, whereas internal nodes are unlabeled. The tree may have a root, r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximal Subspace Coregulated Gene Clustering

    Publication Year: 2008, Page(s):83 - 98
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3355 KB) | HTML iconHTML

    Clustering is a popular technique for analyzing microarray data sets, with n genes and m experimental conditions. As explored by biologists, there is a real need to identify coregulated gene clusters, which include both positive and negative regulated gene clusters. The existing pattern-based and tendency-based clustering approaches cannot directly be applied to find such coregulated gene clusters... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Exploratory Study of Database Integration Processes

    Publication Year: 2008, Page(s):99 - 115
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5896 KB) | HTML iconHTML

    One of the central problems of database integration is schema matching, that is, the identification of similar data elements in two or more databases or other data sources. Existing definitions of "similarity" in this context vary greatly. As a result, schema matching has given rise to a large number of heuristics software tools. However, the empirical understanding of this process in humans is ve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Watermarking Relational Databases Using Optimization-Based Techniques

    Publication Year: 2008, Page(s):116 - 129
    Cited by:  Papers (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4839 KB) | HTML iconHTML

    Proving ownership rights on outsourced relational databases is a crucial issue in today's internet-based application environments and in many content distribution applications. In this paper, we present a mechanism for proof of ownership based on the secure embedding of a robust imperceptible watermark in relational data. We formulate the watermarking of relational databases as a constrained optim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visualization of Ontologies to Specify Semantic Descriptions of Services

    Publication Year: 2008, Page(s):130 - 134
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1081 KB) | HTML iconHTML

    The present paper describes the main characteristics and components of a tool developed for integrating the definition of profiles for semantic Web services. This tool is based on the languages DAML-S and OWL-S. It includes the ontology visualization and consistency verification which specifies the concepts that a Web service interacts with. Starting from a service description interpreted by a com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TKDE 2007 Reviewers List

    Publication Year: 2008, Page(s):135 - 140
    Request permission for commercial reuse | PDF file iconPDF (61 KB)
    Freely Available from IEEE
  • In this issue - Technically

    Publication Year: 2008, Page(s): 141
    Request permission for commercial reuse | PDF file iconPDF (43 KB)
    Freely Available from IEEE
  • Join the IEEE Computer Society [advertisement]

    Publication Year: 2008, Page(s): 142
    Request permission for commercial reuse | PDF file iconPDF (63 KB)
    Freely Available from IEEE
  • Subscribe to IEEE Intelligent Systems [advertisement]

    Publication Year: 2008, Page(s): 143
    Request permission for commercial reuse | PDF file iconPDF (1891 KB)
    Freely Available from IEEE
  • IEEE Distributed Systems Online

    Publication Year: 2008, Page(s): 144
    Request permission for commercial reuse | PDF file iconPDF (549 KB)
    Freely Available from IEEE
  • 2007 Annual Index

    Publication Year: 2008, Page(s): not in print
    Request permission for commercial reuse | PDF file iconPDF (228 KB)
    Freely Available from IEEE
  • TKDE Information for authors

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

    Publication Year: 2008, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (106 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
Xuemin Lin
University of New South Wales

Associate Editor-in-Chief
Lei Chen
Hong Kong University of Science and Technology