By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 10 • Oct. 2009

Filter Results

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

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

    Publication Year: 2009, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (127 KB)
    Freely Available from IEEE
  • A Novel Bayes Model: Hidden Naive Bayes

    Publication Year: 2009, Page(s):1361 - 1371
    Cited by:  Papers (68)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4801 KB) | HTML iconHTML

    Because learning an optimal Bayesian network classifier is an NP-hard problem, learning-improved naive Bayes has attracted much attention from researchers. In this paper, we summarize the existing improved algorithms and propose a novel Bayes model: hidden naive Bayes (HNB). In HNB, a hidden parent is created for each attribute which combines the influences from all other attributes. We experiment... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate Distributed K-Means Clustering over a Peer-to-Peer Network

    Publication Year: 2009, Page(s):1372 - 1388
    Cited by:  Papers (57)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1113 KB) | HTML iconHTML Multimedia Media

    Data intensive peer-to-peer (P2P) networks are finding increasing number of applications. Data mining in such P2P environments is a natural extension. However, common monolithic data mining architectures do not fit well in such environments since they typically require centralizing the distributed data which is usually not practical in a large P2P network. Distributed data mining algorithms that a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automating the Design and Construction of Query Forms

    Publication Year: 2009, Page(s):1389 - 1402
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2027 KB) | HTML iconHTML Multimedia Media

    One of the simplest ways to query a database is through a form where a user can fill in relevant information and obtain desired results by submitting the form. Designing good forms is a nontrivial manual task, and the designer needs a sound understanding of both the data organization and the querying needs. Furthermore, form design usually has conflicting goals: each form should be simple and easy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed View Divergence Control of Data Freshness in Replicated Database Systems

    Publication Year: 2009, Page(s):1403 - 1417
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2276 KB) | HTML iconHTML Multimedia Media

    In this paper, we propose a distributed method to control the view divergence of data freshness for clients in replicated database systems whose facilitating or administrative roles are equal. Our method provides data with statistically defined freshness to clients when updates are initially accepted by any of the replicas, and then, asynchronously propagated among the replicas that are connected ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • estMax: Tracing Maximal Frequent Item Sets Instantly over Online Transactional Data Streams

    Publication Year: 2009, Page(s):1418 - 1431
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4162 KB) | HTML iconHTML

    Frequent item set mining is one of the most challenging issues for descriptive data mining. In general, its resulting set tends to produce a large number of frequent item sets. To represent them in a more compact notation, closed or maximal frequent item sets are often used but finding such item sets over online transactional data streams is not easy due to the requirements of a data stream. For t... View full abstract»

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

    Publication Year: 2009, Page(s):1432 - 1446
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3233 KB) | HTML iconHTML

    In this paper, we first study an important but unsolved dilemma in the literature of subspace clustering, which is referred to as ldquoinformation overlapping-data coveragerdquo challenge. Current solutions of subspace clustering usually invoke a grid-based apriori-like procedure to identify dense regions and construct subspace clusters afterward. Due to the nature of monotonicity property in apri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • General Cost Models for Evaluating Dimensionality Reduction in High-Dimensional Spaces

    Publication Year: 2009, Page(s):1447 - 1460
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2254 KB) | HTML iconHTML

    Similarity search usually encounters a serious problem in the high-dimensional space, known as the "curse of dimensionality". In order to speed up the retrieval efficiency, most previous approaches reduce the dimensionality of the entire data set to a fixed lower value before building indexes (referred to as global dimensionality reduction (GDR)). More recent works focus on locally reducing the di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Granular Computing and Knowledge Reduction in Formal Contexts

    Publication Year: 2009, Page(s):1461 - 1474
    Cited by:  Papers (98)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1339 KB) | HTML iconHTML

    Granular computing and knowledge reduction are two basic issues in knowledge representation and data mining. Granular structure of concept lattices with application in knowledge reduction in formal concept analysis is examined in this paper. Information granules and their properties in a formal context are first discussed. Concepts of a granular consistent set and a granular reduct in the formal c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large Margin Feature Weighting Method via Linear Programming

    Publication Year: 2009, Page(s):1475 - 1488
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5504 KB) | HTML iconHTML

    The problem of feature selection is a difficult combinatorial task in machine learning and of high practical relevance. In this paper, we consider feature selection method for multimodally distributed data, and present a large margin feature weighting method for k-nearest neighbor (kNN) classifiers. The method learns the feature weighting factors by minimizing a cost function, which aims at separa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning Heuristics for the Superblock Instruction Scheduling Problem

    Publication Year: 2009, Page(s):1489 - 1502
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4531 KB) | HTML iconHTML

    Modern processors have multiple pipelined functional units and can issue more than one instruction per clock cycle. This places a burden on the compiler to schedule the instructions to take maximum advantage of the underlying hardware. Superblocks - a straight-line sequence of code with a single entry point and multiple possible exit points - are a commonly used scheduling region within compilers.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Call for Papers: Cloud Data Management

    Publication Year: 2009, Page(s): 1503
    Request permission for commercial reuse | PDF file iconPDF (34 KB)
    Freely Available from IEEE
  • New Title from Wiley and IEEE CS Press

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

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

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