Elsevier

Pattern Recognition

Volume 26, Issue 2, February 1993, Pages 317-324
Pattern Recognition

Prototype optimization for nearest neighbor classifiers using a two-layer perceptron

https://doi.org/10.1016/0031-3203(93)90040-4Get rights and content

Abstract

The performance of a nearest neighbor classifier is degraded if only a small number of training samples are used as prototypes. An algorithm is presented for modifying the prototypes so that the classification rate can be increased. This algorithm makes use of a two-layer perceptron with one second-order input. Each hidden node of the perceptron represents a prototype and the weights of connections between a hidden node and the input nodes are initially set equal to the feature values of the corresponding prototype. The weights are then changed using a gradient-based algorithm to generate a new prototype. The algorithm has been tested with good results.

References (9)

  • H Yau et al.

    Iterative improvement of a nearest neighbor classifier

    Neural Networks

    (1991)
  • R.O Duda et al.

    Pattern Classification and Scene Analysis

    (1973)
  • P.E Hart

    The condensed nearest neighbor rule

    IEEE Trans. Inf. Theory

    (1968)
  • G.W Gates

    The reduced nearest neighbor rule

    IEEE Trans. Inf. Theory

    (1972)
There are more references available in the full text version of this article.

Cited by (46)

  • Reconstruction of broken handwritten digits based on structural morphological features

    2001, Pattern Recognition
    Citation Excerpt :

    Therefore, in this case our reconstruction algorithm is useful. If the recognition algorithm is optimized nearest-neighbor classifier (ONNC) [11,12], the recognition rate is 98.1% without any reconstruction of broken digits, and 99.6% after reconstruction of broken digits. Incorrect reconstruction of the broken digits for the test images is caused by some special new structures not considered in our methods.

View all citing articles on Scopus
View full text