Adaptation Algorithms for Binary Tree Networks

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.