Experiments With Some Programs That Search Game Trees
Journal of the ACM (JACM)
Experiments with the M & N tree-searching program
Communications of the ACM
Computers and Thought
Dynamic Programming
LISP 1.5 Programmer's Manual
A message-based fault diagnosis procedure
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
ACM Computing Surveys (CSUR)
Experiments with some algorithms that find central solutions for pattern classification
Communications of the ACM
A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space
IEEE Transactions on Computers
Model-based probabilistic reasoning for electronics troubleshooting
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
A semantics-based decision theory region analyzer
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
An algorithm to generate prime implicants and its application to the selection problem
Information Sciences: an International Journal
| Hi-index | 48.24 |
A sequential pattern recognition (SPR) procedure does not test all the features of a pattern at once. Instead, it selects a feature to be tested. After receiving the result of that test, the procedure either classifies the unknown pattern or selects another feature to be tested, etc. Medical diagnosis is an example of SPR. In this paper the authors suggest that SPR be viewed as a one-person game played against nature (chance). Virtually all the powerful techniques developed for searching two-person, strictly competitive game trees can easily be incorporated either directly or by analogy into SPR procedures. In particular, one can incorporate the “miniaverage backing-up procedure” and the “gamma procedure,” which are the analogues of the “minimax backing-up procedure” and the “alpha-beta procedure,” respectively. Some computer simulated experiments in character recognition are presented. The results indicate that the approach is promising.