• DocumentCode
    2694185
  • Title

    Neural units recruitment algorithm for generation of decision trees

  • Author

    Deffuant, Guillaume

  • fYear
    1990
  • fDate
    17-21 June 1990
  • Firstpage
    637
  • Abstract
    The neural units recruitment algorithms (NEURAL) are algorithms mixing techniques from neural networks and symbolic machine learning. The size and architecture of the network are not specified before the learning process. Basic cells (perceptron units or delta rule units) are recruited and organized in a structure similar to the one of a decision tree which grows during the learning process (beginning with only one initial cell). As the tree grows, the leaf cells are specialized in smaller and smaller parts of the initial training set. Convergence is guaranteed for any set of patterns, with real inputs and Boolean outputs. Learning can be incremental: learning a new pattern set only alters the parts of the structure concerned with the differences between the old and the new sets
  • Keywords
    convergence; learning systems; neural nets; Boolean outputs; decision tree; delta rule units; leaf cells; learning process; neural units recruitment algorithms; perceptron units; real inputs; supervised learning; symbolic machine learning;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks, 1990., 1990 IJCNN International Joint Conference on
  • Conference_Location
    San Diego, CA, USA
  • Type

    conf

  • DOI
    10.1109/IJCNN.1990.137642
  • Filename
    5726602