By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 5 • Date Oct 1995

Filter Results

Displaying Results 1 - 16 of 16
  • Representing knowledge by neural networks for qualitative analysis and reasoning

    Publication Year: 1995, Page(s):683 - 690
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    A systematic approach has been developed to construct neural networks for qualitative analysis and reasoning. These neural networks are used as specialized parallel distributed processors for solving constraint satisfaction problems. A typical application of such a neural network is to determine a reasonable change of a system after one or more of its variables are changed. A six-node neural netwo... View full abstract»

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

    Publication Year: 1995, Page(s):691 - 698
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    We define a new fixpoint semantics for rule based reasoning in the presence of weighted information. The semantics is illustrated on a real world application requiring such reasoning. Optimizations and approximations of the semantics are shown so as to make the semantics amenable to very large scale real world applications. We finally prove that the semantics is probabilistic and reduces to the us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enriching the expressive power of security labels

    Publication Year: 1995, Page(s):839 - 841
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    Common security models such as Bell-LaPadula focus on the control of access to sensitive data but leave some important systems issues unspecified, such as the implementation of read-only objects, garbage collection, and object upgrade and downgrade paths. Consequently, different implementations of the same security model may have conflicting operational and security semantics. We propose the use o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theoretical and practical considerations of uncertainty and complexity in automated knowledge acquisition

    Publication Year: 1995, Page(s):699 - 712
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1336 KB)

    Inductive machine learning has become an important approach to automated knowledge acquisition from databases. The disjunctive normal form (DNF), as the common analytic representation of decision trees and decision tables (rules), provides a basis for formal analysis of uncertainty and complexity in inductive learning. A theory for general decision trees is developed based on C. Shannon's (1949) e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A graph-based data model and its ramifications

    Publication Year: 1995, Page(s):809 - 823
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1460 KB)

    Currently, database researchers are investigating new data models in order to remedy the deficiencies of the flat relational model when applied to nonbusiness applications. Herein we concentrate on a recent graph based data model called the hypernode model. The single underlying data structure of this model is the hypernode which is a digraph with a unique defining label. We present in detail the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic structuring of knowledge bases by conceptual clustering

    Publication Year: 1995, Page(s):824 - 829
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    An important structuring mechanism for knowledge bases is building an inheritance hierarchy of classes based on the content of their knowledge objects. This hierarchy facilitates group-related processing tasks such as answering set queries, discriminating between objects, finding similarities among objects, etc. Building this hierarchy is a difficult task for the knowledge engineer. Conceptual clu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maintaining temporal consistency: pessimistic vs. optimistic concurrency control

    Publication Year: 1995, Page(s):786 - 796
    Cited by:  Papers (47)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1132 KB)

    We study the performance of concurrency control algorithms in maintaining temporal consistency of shared data in hard real time systems. In our model, a hard real time system consists of periodic tasks which are either write only, read only or update transactions. Transactions may share data. Data objects are temporally inconsistent when their ages and dispersions are greater than the absolute and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-the-fly reading of entire databases

    Publication Year: 1995, Page(s):834 - 838
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    A common database need is to obtain a global-read, which is a consistent read of an entire database. To avoid terminating normal system activity, and thus improve availability, we propose an on-the-fly algorithm that reads database entities incrementally and allows normal transactions to proceed concurrently. The algorithm assigns each entity a color based on whether the entity has been globally r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Acquisition of linguistic patterns for knowledge-based information extraction

    Publication Year: 1995, Page(s):713 - 724
    Cited by:  Papers (25)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1152 KB)

    The paper presents an automatic acquisition of linguistic patterns that can be used for knowledge based information extraction from texts. In knowledge based information extraction, linguistic patterns play a central role in the recognition and classification of input texts. Although the knowledge based approach has been proved effective for information extraction on limited domains, there are dif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Critics for knowledge-based design systems

    Publication Year: 1995, Page(s):740 - 750
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1092 KB)

    Expert critics have been built to critique human performance in various areas such as engineering design, decision making, etc. We suggest that critics can also be useful in the building and use of knowledge based design systems (KBDSs). Knowledge engineers elicit knowledge from domain experts and build a knowledge based design system. The system generates designs. The amount of knowledge the syst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Description logics in data management

    Publication Year: 1995, Page(s):671 - 682
    Cited by:  Papers (66)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1176 KB)

    Description logics and reasoners, which are descendants of the KL-ONE language, have been studied in depth in artificial intelligence. After a brief introduction, we survey their application to the problems of information management, using the framework of an abstract information server equipped with several operations-each involving one or more languages. Specifically, we indicate how one can ach... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The partitioned synchronization rule for planar extendible partial orders

    Publication Year: 1995, Page(s):797 - 808
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1156 KB)

    The partitioned synchronization rule is a technique for proving the correctness of concurrency control algorithms. Prior work has shown the applicability of the partitioned synchronization rule to hierarchically decomposed databases whose structure is restricted to semitrees. The principal contribution of the paper is a demonstration that the partitioned synchronization rule also applies to more g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A nonblocking transaction data flow graph based protocol for replicated databases

    Publication Year: 1995, Page(s):829 - 834
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    Replicated data management systems adopt the 1-copy serializability criteria for processing transactions. In order to achieve this goal, many approaches rely on obtaining votes from other sites for processing update requests. In the proposed approach, a technique for generation of precedence graphs for each transaction execution is analyzed. The transaction data flow graph approach is a fully dist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Genetics-based learning of new heuristics: rational scheduling of experiments and generalization

    Publication Year: 1995, Page(s):763 - 785
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2296 KB)

    We present new methods for the automated learning of heuristics in knowledge lean applications and for finding heuristics that can be generalized to unlearned domains. These applications lack domain knowledge for credit assignment; hence, operators for composing new heuristics are generally model free, domain independent, and syntactic in nature. The operators we have used are genetics based; exam... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Causal knowledge elicitation based on elicitation failures

    Publication Year: 1995, Page(s):725 - 739
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1572 KB)

    The paper presents an approach to causal knowledge elicitation supported by a tool directly used by the domain expert. This knowledge elicitation approach is characterized by trying to guess an interpretation of the knowledge entered by the expert. The tool (initially general), as it is used, self customizes its guessing capability, remembers failures in guessing (in order to avoid similar failure... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quasi-acyclic propositional Horn knowledge bases: optimal compression

    Publication Year: 1995, Page(s):751 - 762
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1132 KB)

    Horn knowledge bases are widely used in many applications. The paper is concerned with the optimal compression of propositional Horn production rule bases-one of the most important knowledge bases used in practice. The problem of knowledge compression is interpreted as a problem of Boolean function minimization. It was proved by P.L. Hammer and A. Kogan (1993) that the minimization of Horn functio... 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