Elsevier

Information Sciences

Volume 71, Issue 3, July 1993, Pages 223-268
Information Sciences

SC-net: A hybrid connectionist, symbolic system

https://doi.org/10.1016/0020-0255(93)90058-TGet rights and content

Abstract

This paper describes the SC-net system that has been developed to provide expert systems capability augmented with learning in a hybrid connectionist/symbolic approach. A distributed connectionist representation of cells connected by links is used to represent symbolic knowledge. Rules may be directly encoded in the connectionist network or learned from examples. The learning method is a form of instance-based learning in which some of the individual instances in the training set are encoded by adding structure to the network and others cause modifications to biases in the network. Both continuous and nominal attributes are directly represented in the network structure. A limited form of variables in the form of attribute value bindings on the right-hand side of rules is supported. Relational comparators in the form of cell groups are also supported. Relational comparators and attribute value structures are represented by groups of connected cells in the network. The learning algorithm is presented and methods for providing generalization in an instance-based connectionist environment are presented. Empirical results are presented, which include learning in domains (fevers and gems) that contain uncertainty and the well-known iris, and soybean data sets together with a real world domain for semiconductor wafer fault diagnosis. The generalization ability of the learned network is shown to be good in several domains including iris. The system is shown to compare favorably with a nonneural instance-based learning algorithm IBL.

References (49)

  • D.S. Touretzky et al.

    A distributed connectionist production system

    Cognitive Science

    (1988)
  • T. Ash

    Dynamic node creation in backpropagation networks

  • D.W. Aha et al.
  • B. Bartell

    SeqNet: A connectionist network for rule driven sequential problem solving

  • B. Chandrasekaran et al.

    Connectionism and information processing abstractions

    AI Magazine

    (Winter, 1988)
  • S.C. Chan et al.

    Neural three-valued-logic networks

  • V. Cherkassky et al.

    Informative data representation and feature extraction for neural network-based expert systems

  • T.M. Cover et al.

    Nearest neighbor pattern classification

    IEEE Trans. Inform. Theory

    (1967)
  • S.E. Fahlman et al.

    Connectionist architecture for artificial intelligence

    IEEE Comput.

    (Jan. 1987)
  • S.E. Fahlman et al.

    The cascade-correlation learning architecture

  • S.E. Fahlman

    Faster-learning variations on backpropagation: An empirical study

  • J.A. Feldman

    Dynamic connections in neural networks

    Biol. Cybernetics

    (1982)
  • B.R. Gaines

    An Ounce of Knowledge is Worth a Ton of Data

    (1989)
  • S.I. Gallant

    Connectionist expert systems

    Commun. ACM

    (1988)
  • R.H. Halstead

    Multilisp: A language for concurrent symbolic computation

    ACM Trans. Program. Languages Syst.

    (1985)
  • L.O. Hall et al.

    A hybrid connectionist, symbolic learning system

    AAAI-90

    (1990)
  • P.E. Hart

    The condensed nearest neighbor rule

    IEEE Trans. Inform. Theory

    (1968)
  • R. Hecht-Nielson

    Neurocomputing

    (1990)
  • V. Honavar et al.

    A network of neuron-like units that learns to perceive by generation as well as reweighting of its links

  • S. Judd

    Learning in neural networks

  • A. Kandel

    Fuzzy Mathematical Techniques with Applications

    (1986)
  • J.M. Keller et al.

    Neural network implementation of fuzzy logic

    (1989)
  • J. M. Keller and H. Tahani, Backpropagation: neural networks for fuzzy logic. Inf. Sci., to...
  • D. Kibler et al.

    Learning representative exemplars of concepts: An initial case study

  • Cited by (0)

    View full text