• DocumentCode
    328335
  • Title

    A framework for combining symbolic and connectionist learning with equivalent concept descriptions

  • Author

    Dabija, Vlad G. ; Tschichold-Gürman, Nadine

  • Author_Institution
    Dept. of Comput. Sci., Stanford Univ., CA, USA
  • Volume
    1
  • fYear
    1993
  • fDate
    25-29 Oct. 1993
  • Firstpage
    790
  • Abstract
    We propose a learning formalism combining symbolic and connectionist learning methods. As opposed to previous such work, we require the two methods to use equivalent concept descriptions (use the same mechanism for dividing the concept space when representing learned concepts), thus taking advantage of a combination of two different but related learning biases while still retaining the understandability of the learned concepts. We give two examples of applying the formalism and experimentally evaluate one of them (using decision trees and M-RCE networks). The integration of the two paradigms in our formalism and its application to several domains with different characteristics yielded consistently better classification performance than each of its separate components.
  • Keywords
    learning (artificial intelligence); neural nets; symbol manipulation; M-RCE networks; connectionist learning; decision trees; equivalent concept descriptions; symbolic learning; understandability; Artificial neural networks; Backpropagation; Classification tree analysis; Decision trees; Knowledge based systems; Learning systems; Multilayer perceptrons; Performance evaluation; Speech recognition; Time measurement;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks, 1993. IJCNN '93-Nagoya. Proceedings of 1993 International Joint Conference on
  • Print_ISBN
    0-7803-1421-2
  • Type

    conf

  • DOI
    10.1109/IJCNN.1993.714032
  • Filename
    714032