By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 6 • Date June 2006

Filter Results

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

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

    Publication Year: 2006, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (94 KB)
    Freely Available from IEEE
  • Fast discovery and the generalization of strong jumping emerging patterns for building compact and accurate classifiers

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

    Classification of large data sets is an important data mining problem that has wide applications. Jumping emerging patterns (JEPs) are those itemsets whose supports increase abruptly from zero in one data set to nonzero in another data set. In this paper, we propose a fast, accurate, and less complex classifier based on a subset of JEPs, called strong jumping emerging patterns (SJEPs). The support... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic grouping strategies based on a conceptual graph for cooperative learning

    Publication Year: 2006, Page(s):738 - 747
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1698 KB) | HTML iconHTML

    In large classrooms, teachers rarely have time to monitor the status of individual students. As a result, students who learn quickly thoroughly grasp the content, while students who learn slowly fall further and further behind until, in some cases, the education system gives up on them completely. Teachers thus need a system to help them obtain the status of all students and manage particular stud... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • KDX: an indexer for support vector machines

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

    Support vector machines (SVMs) have been adopted by many data mining and information-retrieval applications for learning a mining or query concept, and then retrieving the "top-k" best matches to the concept. However, when the data set is large, naively scanning the entire data set to find the top matches is not scalable. In this work, we propose a kernel indexing strategy to substantially prune t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Closed constrained gradient mining in retail databases

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

    Incorporating constraints into frequent itemset mining not only improves data mining efficiency, but also leads to concise and meaningful results. In this paper, a framework for closed constrained gradient itemset mining in retail databases is proposed by introducing the concept of gradient constraint into closed itemset mining. A tailored version of CLOSET+, LCLOSET, is first briefly introduced, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient classification across multiple database relations: a CrossMine approach

    Publication Year: 2006, Page(s):770 - 783
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1894 KB) | HTML iconHTML

    Relational databases are the most popular repository for structured data, and is thus one of the richest sources of knowledge in the world. In a relational database, multiple relations are linked together via entity-relationship links. Multirelational classification is the procedure of building a classifier based on information stored in multiple relations and making predictions with it. Existing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An exact closed-form formula for d-dimensional quadtree decomposition of arbitrary hyperrectangles

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

    In this paper, we solve the classic problem of computing the average number of decomposed quadtree blocks (quadrants, nodes, or pieces) in quadtree decomposition for an arbitrary hyperrectangle aligned with the axes. We derive a closed-form formula for general cases. The previously known state-of-the-art solution provided a closed-form solution for special cases and utilized these formulas to deri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and computing ternary projective relations between regions

    Publication Year: 2006, Page(s):799 - 814
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2007 KB) | HTML iconHTML

    Current spatial database systems offer limited querying capabilities beyond binary topological relations. This paper introduces a model for projective relations between regions to support other qualitative spatial queries. The relations are ternary because they are based on the collinearity invariant of three points under projective geometry. The model is built on a partition of the plane into sep... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generic library of problem solving methods for scheduling applications

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

    In this paper, we propose a generic library of problem-solving methods for scheduling applications. Although some attempts have been made in the past at developing the libraries of scheduling problem-solvers, these only provide limited coverage. Many lack generality, as they subscribe to a particular scheduling domain. Others simply implement a particular problem-solving technique, which may be ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fuzzy metagraph and its combination with the indexing approach in rule-based systems

    Publication Year: 2006, Page(s):829 - 841
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1284 KB) | HTML iconHTML

    This paper presents a graph-theoretic construct called a fuzzy metagraph (FM) with the capability of describing the relationships between sets of fuzzy elements instead of only single fuzzy elements. The algebraic structure of FM and its properties are extensively investigated. Subsequently, the FM construct is applied to rule-based systems. First, we propose FM-based knowledge representation in b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic fuzzy ontology generation for semantic Web

    Publication Year: 2006, Page(s):842 - 856
    Cited by:  Papers (149)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1925 KB) | HTML iconHTML

    Ontology is an effective conceptualism commonly used for the semantic Web. Fuzzy logic can be incorporated to ontology to represent uncertainty information. Typically, fuzzy ontology is generated from a predefined concept hierarchy. However, to construct a concept hierarchy for a certain domain can be a difficult and tedious task. To tackle this problem, this paper proposes the FOGA (fuzzy ontolog... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved word-aligned binary compression for text indexing

    Publication Year: 2006, Page(s):857 - 861
    Cited by:  Papers (12)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (361 KB) | HTML iconHTML

    We present an improved compression mechanism for handling the compressed inverted indexes used in text retrieval systems, extending the word-aligned binary coding carry method. Experiments using two typical document collections show that the new method obtains superior compression to previous static codes, without penalty in terms of execution speed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TKDE Information for authors

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

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

    Publication Year: 2006, Page(s): 863
    Request permission for commercial reuse | PDF file iconPDF (75 KB)
    Freely Available from IEEE
  • IEEE Computer Society celebrates two 60-year anniversaries

    Publication Year: 2006, Page(s): 862
    Request permission for commercial reuse | PDF file iconPDF (102 KB)
    Freely Available from IEEE
  • Join the IEEE Computer Society

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