Elsevier

Pattern Recognition

Volume 30, Issue 2, February 1997, Pages 281-288
Pattern Recognition

Finding prototypes for nearest neighbour classification by means of gradient descent and deterministic annealing

https://doi.org/10.1016/S0031-3203(96)00072-6Get rights and content

Abstract

A new method is presented to find prototypes for a nearest neighbour classifier. The prototype locations are optimised through a gradient descent and a deterministic annealing process. The proposed algorithm also includes an initialisation strategy which aims to provide the maximum classification rate on the training set with the minimum number of prototypes. Experiments show the efficiency of this algorithm on both real and artificial data.

References (20)

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

Cited by (0)

Tel.: +32 2 650 3165; fax: +32 2 650 2715

View full text