By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 11 • Date Nov. 2006

Filter Results

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

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

    Publication Year: 2006, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (87 KB)
    Freely Available from IEEE
  • Discovering Frequent Graph Patterns Using Disjoint Paths

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

    Whereas data mining in structured data focuses on frequent data values, in semistructured and graph data mining, the issue is frequent labels and common specific topologies. The structure of the data is just as important as its content. We study the problem of discovering typical patterns of graph data, a task made difficult because of the complexity of required subtasks, especially subgraph isomo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some Effective Techniques for Naive Bayes Text Classification

    Publication Year: 2006, Page(s):1457 - 1466
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1427 KB) | HTML iconHTML

    While naive Bayes is quite effective in various data mining tasks, it shows a disappointing result in the automatic text classification problem. Based on the observation of naive Bayes for the natural language text, we found a serious problem in the parameter estimation process, which causes poor results in text classification domain. In this paper, we propose two empirical heuristics: per-documen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discovering Frequent Closed Partial Orders from Strings

    Publication Year: 2006, Page(s):1467 - 1481
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2019 KB) | HTML iconHTML

    Mining knowledge about ordering from sequence data is an important problem with many applications, such as bioinformatics, Web mining, network management, and intrusion detection. For example, if many customers follow a partial order in their purchases of a series of products, the partial order can be used to predict other related customers' future purchases and develop marketing campaigns. Moreov... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning Contextual Dependency Network Models for Link-Based Classification

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

    Links among objects contain rich semantics that can be very helpful in classifying the objects. However, many irrelevant links can be found in real-world link data such as Web pages. Often, these noisy and irrelevant links do not provide useful and predictive information for categorization. It is thus important to automatically identify which links are most relevant for categorization. In this pap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Mining Instance-Centric Classification Rules

    Publication Year: 2006, Page(s):1497 - 1511
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2832 KB) | HTML iconHTML

    Many studies have shown that rule-based classifiers perform well in classifying categorical and sparse high-dimensional databases. However, a fundamental limitation with many rule-based classifiers is that they find the rules by employing various heuristic methods to prune the search space and select the rules based on the sequential database covering paradigm. As a result, the final set of rules ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Access Structures for Angular Similarity Queries

    Publication Year: 2006, Page(s):1512 - 1525
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2769 KB) | HTML iconHTML

    Angular similarity measures have been utilized by several database applications to define semantic similarity between various data types such as text documents, time-series, images, and scientific data. Although similarity searches based on Euclidean distance have been extensively studied in the database community, processing of angular similarity searches has been relatively untouched. Problems d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and Performance Evaluation of Broadcast Algorithms for Time-Constrained Data Retrieval

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

    We refer "time-constrained services" to those requests that have to be replied to within a certain client-expected time duration. If the answer cannot reach the client within this expected time, the value of the information may seriously degrade or even become useless. On-demand channels may not be able to handle all time-constrained services without degrading the performance. How to handle these ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical Indexing Structure for Efficient Similarity Search in Video Retrieval

    Publication Year: 2006, Page(s):1544 - 1559
    Cited by:  Papers (19)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4665 KB) | HTML iconHTML

    With the rapid increase in both centralized video archives and distributed WWW video resources, content-based video retrieval is gaining its importance. To support such applications efficiently, content-based video indexing must be addressed. Typically, each video is represented by a sequence of frames. Due to the high dimensionality of frame representation and the large number of frames, video in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental Processing of Continual Range Queries over Moving Objects

    Publication Year: 2006, Page(s):1560 - 1575
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5334 KB) | HTML iconHTML

    Efficient processing of continual range queries over moving objects is critically important in providing location-aware services and applications. A set of continual range queries, each defining the geographical region of interest, can be periodically (re)evaluated to locate moving objects that are currently within individual query boundaries. We study a new query indexing method, called CES-based... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decentralized Assignment Reasoning Using Collaborative Local Mediation

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

    The collaborative linear assignment problem (CLAP) is a recent framework being developed to provide an intellectual basis for investigating uncluttered agent-based solutions for a fundamental class of combinatorial assignment (or allocation) applications. One key motivation of the research on CLAP is the hope that it can shed new light on adopting agent approaches for solving traditional combinato... 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: 2006, Page(s): 1581
    Request permission for commercial reuse | PDF file iconPDF (356 KB)
    Freely Available from IEEE
  • IEEE ReadyNotes: quick-start references

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

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

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