ADAPTATION ALGORITHMS FOR BINARY TREE NETWORKS

被引：21

作者：

ARMSTRONG, WW

GECSEI, J

机构：

[1] Département d'Informatique et de Recherche Opérationnelle, Université de Montréal, Montréal, PQ

来源：

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS | 1979年 / 9卷 / 05期

关键词：

D O I：

10.1109/TSMC.1979.4310196

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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. Copyright © 1979 by The Institute of Electrical and Electronics Engineers, Inc.

引用

页码：276 / 285

页数：10

共 11 条

[1]

ARMSTRONG WW, 95 U MONTR DEP INF R

[2]

ARMSTRONG WW, 1978, 12TH P ANN AS C CIRC

[3]

ARMSTRONG WW, 1975 P IEEE INT C CY, P447

[4]

ARMSTRONG WW, 1976, Patent No. 3934231

[5]

ARMSTRONG WW, 1974, 53 U MONTR DEP INF R

[6]

BOCHMANN GV, 1974, BIT, V13, P1

[7]

Curtis H. A., 1962, NEW APPROACH DESIGN

[8] The use of multiple measurements in taxonomic problems [J].

Fisher, RA .

ANNALS OF EUGENICS, 1936, 7 :179-188

[9] LINEAR DECISION FUNCTIONS, WITH APPLICATION TO PATTERN RECOGNITION [J].

HIGHLEYMAN, WH .

PROCEEDINGS OF THE INSTITUTE OF RADIO ENGINEERS, 1962, 50 (06) :1501-&

[10] STEPS TOWARD ARTIFICIAL INTELLIGENCE [J].

MINSKY, M .

PROCEEDINGS OF THE INSTITUTE OF RADIO ENGINEERS, 1961, 49 (01) :8-+

← 1 2 →