By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 2 • Date Mar/Apr 1998

Filter Results

Displaying Results 1 - 11 of 11
  • Discovering frequent event patterns with multiple granularities in time sequences

    Publication Year: 1998, Page(s):222 - 237
    Cited by:  Papers (33)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    An important usage of time sequences is to discover temporal patterns. The discovery process usually starts with a user specified skeleton, called an event structure, which consists of a number of variables representing events and temporal constraints among these variables; the goal of the discovery is to find temporal patterns, i.e., instantiations of the variables in the structure that appear fr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient attribute-oriented generalization for knowledge discovery from large databases

    Publication Year: 1998, Page(s):193 - 208
    Cited by:  Papers (29)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    We present GDBR (Generalize DataBase Relation) and FIGR (Fast, Incremental Generalization and Regeneralization), two enhancements of Attribute Oriented Generalization, a well known knowledge discovery from databases technique. GDBR and FIGR are both O(n) and, as such, are optimal. GDBR is an online algorithm and requires only a small, constant amount of space. FIGR also requires a constant amount ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Principal interconnections in higher order Hebbian-type associative memories

    Publication Year: 1998, Page(s):342 - 344
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (56 KB)

    The existence of principal interconnections useful in solving the proliferation problem in higher order Hebbian-type associative memories is introduced. Among all legal interconnections, the author proves there exists a subset Tpr that carries more information than the others. Regardless of the network order p, the elements in Tpr are shown to be those interconnections T that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A decision model for choosing the optimal level of storage in temporal databases

    Publication Year: 1998, Page(s):297 - 309
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    A database allows its users to reduce uncertainty about the world. However, not all properties of all objects can always be stored in a database. As a result, the user may have to use probabilistic inference rules to estimate the data required for his decisions. A decision based on such estimated data may not be perfect. The authors call the costs associated with such suboptimal decisions the cost... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient data mining for path traversal patterns

    Publication Year: 1998, Page(s):209 - 221
    Cited by:  Papers (161)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    The authors explore a new data mining capability that involves mining path traversal patterns in a distributed information-providing environment where documents or objects are linked together to facilitate interactive access. The solution procedure consists of two steps. First, they derive an algorithm to convert the original sequence of log data into a set of maximal forward references. By doing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of rule-based systems using state space graphs

    Publication Year: 1998, Page(s):238 - 254
    Cited by:  Papers (12)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    Embedded rule-based expert systems must satisfy stringent timing constraints when applied to real-time environments. The paper describes a novel approach to reduce the response time of rule-based expert systems. The optimization method is based on a construction of the reduced cycle-free finite state space graph. In contrast with traditional state space graph derivation, the optimization algorithm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A qualitative discriminant approach for generating quantitative belief functions

    Publication Year: 1998, Page(s):345 - 348
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB)

    The authors present an approach that will be useful in knowledge acquisition from experts on the degree of belief in, or the probability of, the truthfulness of various propositions. Its advantages include exploring the given problem situation using linguistic quantifiers; avoiding the premature use of numeric measures; and identifying input data that is inconsistent with the theory of belief func... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ADOME: an advanced object modeling environment

    Publication Year: 1998, Page(s):255 - 276
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (936 KB)

    ADOME, which stands for ADvanced Object Modeling Environment, is an approach to integrating data and knowledge management based on object oriented technology. Next generation information systems will require more flexible data modeling capabilities than those provided by current object oriented DBMSs. In particular, integration of data and knowledge management capabilities will become increasingly... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Differential relational calculus for integrity maintenance

    Publication Year: 1998, Page(s):328 - 341
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    A differential calculus for first-order logic is developed to enforce database integrity. Formal differentiation of first-order sentences is useful in maintaining database integrity, since once a database constraint is expressed as a first-order sentence, its derivative with respect to a transaction provides the necessary and sufficient condition for maintaining integrity. The derivative is often ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalability analysis of declustering methods for multidimensional range queries

    Publication Year: 1998, Page(s):310 - 327
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    Efficient storage and retrieval of multi-attribute data sets has become one of the essential requirements for many data-intensive applications. The Cartesian product file has been known as an effective multi-attribute file structure for partial-match and best-match queries. Several heuristic methods have been developed to decluster Cartesian product files across multiple disks to obtain high perfo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal semantic assumptions and their use in databases

    Publication Year: 1998, Page(s):277 - 296
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    Data explicitly stored in a temporal database are often associated with certain semantic assumptions. Each assumption can be viewed as a way of deriving implicit information from explicitly stored data. Rather than leaving the task of deriving (possibly infinite) implicit data to application programs, as is the case currently, it is desirable that this be handled by the database management system.... 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