Adaptation Algorithms for Binary Tree Networks
- 1 May 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. 9 (5) , 276-285
- https://doi.org/10.1109/tsmc.1979.4310196
Abstract
The automatic synthesis of Boolean switching functions by adaptive tree networks is discussed. The concept of heuristic responsibility, by means of which parts of a tree become specialized to certain subsets of input vectors, is explained. Applications to pattern recognition and optical character recognition (OCR) problems are described.Keywords
This publication has 4 references indexed in Scilit:
- Properties of boolean functions with a tree decompositionBIT Numerical Mathematics, 1974
- Linear Decision Functions, with Application to Pattern RecognitionProceedings of the IRE, 1962
- Steps toward Artificial IntelligenceProceedings of the IRE, 1961
- THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMSAnnals of Eugenics, 1936