A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Neural network recognizer for hand-written zip code digits
Advances in neural information processing systems 1
Introduction to statistical pattern recognition (2nd ed.)
Introduction to statistical pattern recognition (2nd ed.)
Recognizing hand-printed letters and digits
Advances in neural information processing systems 2
Advances in computer chess 6
Semiconductors and electronic devices (3rd ed.)
Semiconductors and electronic devices (3rd ed.)
Optical Computing: An Introduction
Optical Computing: An Introduction
Characteristics of Optical Text Recognition Programs
Programming and Computing Software
Data mining tasks and methods: Classification: nearest-neighbor approaches
Handbook of data mining and knowledge discovery
| Hi-index | 0.14 |
A technique for creating and searching a tree of patterns using relative distances is presented. The search is conducted to find patterns which are nearest neighbors of a given test pattern. The structure of the tree is such that the search time is proportional to the distance between the test pattern and its nearest neighbor, which suggests the anomalous possibility that a larger tree, which can be expected on average to contain closer neighbors, can be searched faster than a smaller tree. The technique has been used to recognize OCR digit samples derived from NIST data at an accuracy rate of 97% using a tree of 7,000 patterns.