Abstract
We present two online gradient learning algorithms to design condensed k-nearest neighbor (NN) classifiers. The goal of these learning procedures is to minimize a measure of performance closely related to the expected misclassification rate of the k-NN classifier. One possible implementation of the algorithm is given. Converge properties are analyzed and connections with other works are established. We compare these learning procedures with Kononen’s LVQ algorithms [7] and k-NN classification using the handwritten NIST databases [5]. Experimental results demonstrate the potential of the proposed learning algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Benveniste, M. Métivier and P. Priouret, “Adaptive Algorithms and Stochastic Approximations,” Springer-Verlag, 1990
L. Bottou “Online Learning and Stochastic Approximations”, Technical Report, AT&T Labs-Research, 1996
R. O. Duda and P. E. Hart. “Pattern Classification and Scene Analysis”, John Wiley Interscience, 1973
M. Garris et al. “NIST Form-Based Handprint Recognition System (Release 2.0)”, National Institute of Standards and Technology, 1997
Robert M. Gray and Richard A. Olshen. “Vector Quantization and Density estimation”, Technical Report, Department of Electrical Engineering, Stanford University, 1997
T. Kohonen, J. Hynninen, J. Kangas, J. Laaksonen and K. Torkkola, Kari. “LVQ_PAK. The Learning Vector Quantization Program Package. Version 3.1”, Laboratory of Computer and Information Science, Helsinki University of Tecchnology, April 7, 1995
T. Kohonen. “Self-organizing Maps”, 2nd Edition, Springer-Verlag, 1996.
D. Ripley “Pattern Recognition and Neural Networks”, Oxford University Press, 1996
Michael E. Tarter and Michael D. Lock, “Model-Free Curve Estimation”, Chapman & Hall, 1993
K. Urahama and Y. Furukawa. “Gradient Descent Learning of Nearest Neighbor Classifiers with Outlier Rejection”, Pattern Recognition, Vol. 28, No. 5, pp. 761–768, 1995
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bermejo, S., Cabestany, J. (1999). On-line gradient learning algorithms for K-nearest neighbor classifiers. In: Mira, J., Sánchez-Andrés, J.V. (eds) Foundations and Tools for Neural Modeling. IWANN 1999. Lecture Notes in Computer Science, vol 1606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0098212
Download citation
DOI: https://doi.org/10.1007/BFb0098212
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66069-9
Online ISBN: 978-3-540-48771-5
eBook Packages: Springer Book Archive