Heuristics for Signature Table Analysis as a Pattern Recognition Technique
- 1 January 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. 7 (2) , 77-86
- https://doi.org/10.1109/TSMC.1977.4309658
Abstract
The signature table method is a hierarchical approach for the recognition of binary patterns which are described by means of many features. The method was first applied by A. L. Samuel and his students for prediction of whether a given checker position was master quality or not. The variants of the methods discussed herein consider it as a general pattern recognition technique. Examples are presented to suggest both the potential and hazards of using the method for recognition of patterns. Advantages of the method are the extraction of nonlinear Boolean relationships among the variables, the use of incomplete data in a routine way, and that it sometimes may provide better prediction at less cost than multiple regression. The principle disadvantage, the lack of a theory to guide the choice of key parameters in the method, can sometimes be overcome by systematic computer search.Keywords
This publication has 3 references indexed in Scilit:
- Quantization Complexity and Independent MeasurementsIEEE Transactions on Computers, 1974
- AUTOMATIC DATA SCREENING: A PRACTICAL SOLUTION TO THE MULTIVARIATE PROBLEM IN CLINICAL DATAAnnals of the New York Academy of Sciences, 1969
- Some Studies in Machine Learning Using the Game of Checkers. II—Recent ProgressIBM Journal of Research and Development, 1967