By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 5 • Date Sep/Oct 1999

Filter Results

Displaying Results 1 - 9 of 9
  • The ant system applied to the quadratic assignment problem

    Publication Year: 1999, Page(s):769 - 778
    Cited by:  Papers (201)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    In recent years, there has been growing interest in algorithms inspired by the observation of natural phenomena to define computational procedures that can solve complex problems. We describe a distributed heuristic algorithm that was inspired by the observation of the behavior of ant colonies, and we propose its use for the quadratic assignment problem. The results obtained in solving several cla... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mining multiple-level association rules in large databases

    Publication Year: 1999, Page(s):798 - 805
    Cited by:  Papers (80)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB)

    A top-down progressive deepening method is developed for efficient mining of multiple-level association rules from large transaction databases based on the a priori principle. A group of variant algorithms is proposed based on the ways of sharing intermediate results, with the relative performance tested and analyzed. The enforcement of different interestingness measurements to find more interesti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Splitting and merging version spaces to beam disjunctive concepts

    Publication Year: 1999, Page(s):813 - 815
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    We have modified the original version space strategy in order to learn disjunctive concepts incrementally and without saving past training instances. The algorithm time complexity is also analyzed, and its correctness is proven View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Server capacity planning for Web traffic workload

    Publication Year: 1999, Page(s):731 - 747
    Cited by:  Papers (21)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1360 KB)

    The goal of the paper is to provide a methodology for determining bandwidth requirements for various hardware components of a World Wide Web server. The paper assumes a traditional symmetric multiprocessor (SMP) architecture for the Web server, although the same analysis applies to an SMP node in a cluster. The paper derives formulae for bandwidth demands for memory, processor data bus, network ad... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Part-whole relationship categories and their application in object-oriented analysis

    Publication Year: 1999, Page(s):779 - 797
    Cited by:  Papers (15)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    Part decomposition and conversely, the construction of composite objects from individual parts have long been recognized as ubiquitous and essential mechanisms involving abstraction. This applies, in particular, in areas such as CAD, manufacturing, software development and computer graphics. Although the part-of relationship is distinguished in object oriented modeling techniques, it ranks far beh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data categorization using decision trellises

    Publication Year: 1999, Page(s):697 - 712
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1724 KB)

    We introduce a probabilistic graphical model for supervised learning on databases with categorical attributes. The proposed belief network contains hidden variables that play a role similar to nodes in decision trees and each of their states either corresponds to a class label or to a single attribute test. As a major difference with respect to decision trees, the selection of the attribute to be ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Induction by attribute elimination

    Publication Year: 1999, Page(s):805 - 812
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB)

    In most data mining applications where induction is used as the primary tool for knowledge extraction from real world databases, it is difficult to precisely identify a complete set of relevant attributes. The paper introduces a novel rule induction algorithm called Rule Induction Two In One (RITIO), which eliminates attributes in the order of decreasing irrelevancy. Like ID3-like decision tree co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new architecture for integration of CORBA and OODB

    Publication Year: 1999, Page(s):748 - 768
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1284 KB)

    Object oriented database system (OODB) supports an object oriented data model with the functionality of persistency and transaction semantics. In order to facilitate the use of OODB, the Object Database Management Group (ODMG) defined a standard for object database management systems. On the other hand, the Object Management Group (OMG) defined the Common Object Request Broker Architecture (CORBA)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Building hypertext links by computing semantic similarity

    Publication Year: 1999, Page(s):713 - 730
    Cited by:  Papers (24)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    Most current automatic hypertext generation systems rely on term repetition to calculate the relatedness of two documents. There are well-recognized problems with such approaches, most notably, a vulnerability to the effects of synonymy (many words for the same concept) and polysemy (many concepts for the same word). We propose a novel method for automatic hypertext generation that is based on a t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

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