By Topic

Knowledge and Data Engineering, IEEE Transactions on

Issue 2 • Date Mar/Apr 1997

Filter Results

Displaying Results 1 - 14 of 14
  • A generalized version space learning algorithm for noisy and uncertain data

    Publication Year: 1997 , Page(s): 336 - 340
    Cited by:  Papers (27)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (108 KB)  

    This paper generalizes the learning strategy of version space to manage noisy and uncertain training data. A new learning algorithm is proposed that consists of two main phases: searching and pruning. The searching phase generates and collects possible candidates into a large set; the pruning then prunes this set according to various criteria to find a maximally consistent version space. When the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Text compression for dynamic document databases

    Publication Year: 1997 , Page(s): 302 - 313
    Cited by:  Papers (9)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (292 KB)  

    For compression of text databases, semi-static word-based methods provide good performance in terms of both speed and disk space, but two problems arise. First, the memory requirements for the compression model during decoding can be unacceptably high. Second, the need to handle document insertions means that the collection must be periodically recompressed if compression efficiency is to be maint... View full abstract»

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

    Publication Year: 1997 , Page(s): 341 - 349
    Cited by:  Papers (14)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (208 KB)  

    Using formal specifications to represent software components facilitates the determination of reusability because they more precisely characterize the functionality of the software, and the well-defined syntax makes processing amenable to automation. This paper presents an approach, based on formal methods, to the search, retrieval, and modification of reusable software components. From a two-tier... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Block-oriented compression techniques for large statistical databases

    Publication Year: 1997 , Page(s): 314 - 328
    Cited by:  Papers (13)  |  Patents (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (408 KB)  

    Disk I/O has long been a performance bottleneck for very large databases. Database compression can be used to reduce disk I/O bandwidth requirements for large data transfers. The authors explore the compression of large statistical databases and propose techniques for organizing the compressed data such that standard database operations such as retrievals, inserts, deletes and modifications are su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dismountable media management in tertiary storage systems

    Publication Year: 1997 , Page(s): 350 - 351
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (44 KB)  

    We describe an adaptive algorithm for tertiary storage media mount management. This predictive longest next reference mount management algorithm attempts to approximate the optimal page replacement policy, OPT View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental computation of set difference views

    Publication Year: 1997 , Page(s): 251 - 261
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (284 KB)  

    Views can be computed by means of recomputation or they can be computed incrementally. Incremental view computation outperforms view recomputation in many situations. This is particularly true in distributed database environments such as data warehousing environments. The authors present and analyze two algorithms for the incremental computation of relational set difference views. Set differences ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experience with rule induction and k-nearest neighbor methods for interface agents that learn

    Publication Year: 1997 , Page(s): 329 - 335
    Cited by:  Papers (6)  |  Patents (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (220 KB)  

    Interface agents are being developed to assist users with a variety of tasks. To perform effectively, such agents need knowledge of user preferences. An agent architecture has been developed which observes a user performing tasks, and identifies features which can be used as training data by a learning algorithm. Using the learned profile, an agent can give advice to the user on dealing with new s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Divergence control algorithms for epsilon serializability

    Publication Year: 1997 , Page(s): 262 - 274
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (376 KB)  

    The paper presents divergence control methods for epsilon serializability (ESR) in centralized databases. ESR alleviates the strictness of serializability (SR) in transaction processing by allowing for limited inconsistency. The bounded inconsistency is automatically maintained by divergence control (DC) methods in a way similar to SR is maintained by concurrency control (CC) mechanisms. However, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A semantic framework of the multilevel secure relational model

    Publication Year: 1997 , Page(s): 292 - 301
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (280 KB)  

    A multilevel relational database represents information in a multilevel state of the world, which is the knowledge of the truth value of a statement with respect to a level in a security lattice. The authors develop a semantic framework of the multilevel secure relational model with tuple-level labelling, which formalizes the notion of validity in multilevel relational databases. They also identif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sharing metainformation to guide cooperative search among heterogeneous reusable agents

    Publication Year: 1997 , Page(s): 193 - 208
    Cited by:  Papers (8)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (540 KB)  

    A reusable agent is a self-contained computational system that implements some specific expertise and that can be embedded into diverse applications requiring that expertise. Systems composed of heterogeneous reusable agents are potentially highly adaptable, maintainable, and affordable, assuming that integration issues such as information sharing, coordination, and conflict management can be effe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A form-based natural language front-end to a CIM database

    Publication Year: 1997 , Page(s): 238 - 250
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (252 KB)  

    The paper presents a methodology for developing a user interface that combines fourth generation interface tools (SQL forms) with a natural language processor for a database management system. The natural language processor consists of an index, a lexicon and a parser. The index is used to uniquely identify each form in the system through a conceptual representation of its purpose. The form fields... View full abstract»

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

    Publication Year: 1997 , Page(s): 209 - 220
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (424 KB)  

    Knowledge acquisition is one of the most important and problematic aspects of developing knowledge-based systems. Many automated tools have been introduced in the past, however, manual techniques are still heavily used. Interviewing is one of the most commonly used manual techniques for a knowledge acquisition process, and few automated support tools exist to help knowledge engineers enhance their... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A data/knowledge paradigm for the modeling and design of operations support systems

    Publication Year: 1997 , Page(s): 275 - 291
    Cited by:  Papers (3)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (552 KB)  

    The paper develops the Smart Object paradigm and its instantiation, which provide a new conceptualization for the modeling, design, and development of an important but little researched class of information systems, operations support systems (OSS). OSS is the authors' term for systems which provide interactive support for the management of large, complex operations environments, such as manufactu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using directed hypergraphs to verify rule-based expert systems

    Publication Year: 1997 , Page(s): 221 - 237
    Cited by:  Papers (27)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (468 KB)  

    Rule-based representation techniques have become popular for storage and manipulation of domain knowledge in expert systems. It is important that systems using such a representation are verified for accuracy before implementation. In recent years, graphical techniques have been found to provide a good framework for the detection of errors that may appear in a rule base. The authors present a graph... 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