Issue No.11 - November (1974 vol.23)
null Chin-Liang Chang , IBM Research Laboratory
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.
Discriminant functions, generation of prototypes, minimal spanning tree algorithm, nearest neighbor classifiers, pattern recognition, piecewise linear classifiers, recognition rates, test sets, training sets.
null Chin-Liang Chang, "Finding Prototypes For Nearest Neighbor Classifiers", IEEE Transactions on Computers, vol.23, no. 11, pp. 1179-1184, November 1974, doi:10.1109/T-C.1974.223827