Finding Prototypes For Nearest Neighbor Classifiers
- 1 November 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-23 (11), 1179-1184
- https://doi.org/10.1109/t-c.1974.223827
Abstract
A nearest neighbor classifier is one which assigns a pattern to the class of the nearest prototype. An algorithm is given to find prototypes for a nearest neighbor classifier. The idea is to start with every sample in a training set as a prototype, and then successively merge any two nearest prototypes of the same class so long as the recognition rate is not downgraded. The algorithm is very effective. For example, when it was applied to a training set of 514 cases of liver disease, only 34 prototypes were found necessary to achieve the same recognition rate as the one using the 514 samples of the training set as prototypes. Furthermore, the number of prototypes in the algorithm need not be specified beforehand.Keywords
This publication has 8 references indexed in Scilit:
- Pattern Recognition by Piecewise Linear Discriminant FunctionsIEEE Transactions on Computers, 1973
- Is computerized diagnosis possible?Computers and Biomedical Research, 1972
- Graph-Theoretical Methods for Detecting and Describing Gestalt ClustersIEEE Transactions on Computers, 1971
- Algorithm AS 13: Minimum Spanning TreeJournal of the Royal Statistical Society Series C: Applied Statistics, 1969
- The condensed nearest neighbor rule (Corresp.)IEEE Transactions on Information Theory, 1968
- Nearest neighbor pattern classificationIEEE Transactions on Information Theory, 1967
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMSAnnals of Eugenics, 1936