论文信息 - Adaptation Algorithms for Binary Tree Networks

Adaptation Algorithms for Binary Tree Networks

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.

Jan Gecsei | William W. Armstrong | W. W. Armstrong | J. Gecsei

[1] W. Highleyman. Linear Decision Functions, with Application to Pattern Recognition , 1962, Proceedings of the IRE.

[2] R. Fisher. THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS , 1936 .

[3] Marvin Minsky,et al. Steps toward Artificial Intelligence , 1995, Proceedings of the IRE.

[4] W. W. Armstrong,et al. Properties of boolean functions with a tree decomposition , 1974 .