Abstract
The reference set reduction algorithm for 1-NN rule, resulting in the consistent reduced reference sets, is presented. The algorithm uses well known Hart’s algorithm. Samples from the reference set are initially sorted by two keys. The first one is the largest number of nearest neighbours from the same class, while the second one is a mutual distance measure introduced by Gowda and Krishna. The simple artificial example is used to show how the proposed algorithm operates. Two sets known as phoneme and satimage data have been used to verify the algorithm effectiveness, which is compared with the one offered by Gowda-Krishna algorithm.
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
Hart P.E. (1968) The condensed nearest neighbor rule. IEEE Transactions on Information Theory, vol. IT-14, no. 3 (Corresp.), pp. 515–516
Gowda K.C. and Krishna G. (1979) The condensed nearest neighbor rule using the concept of mutual nearest neighborhood. IEEE Transaction on Information Theory, v. IT-25, no. 4, pp. 488–490
Theodoridis S., Koutroumbas K. (2006) Pattern Recognition-Third Edition. Academic Press-Elsevier, USA
Duda R.O., Hart P.E., Stork D.G. (2001) Pattern Classification-Second Edition. John Wiley & Sons, Inc
Newman D.J., Hettich S., Blake C.L., Merz C.J.(1998), UCI Repository of machine learning databases. Irvine, CA: University of California, Department of Information and Computer Science [http://www.ics.uci.edu/~mlearn/MLRepository.html]
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Raniszewski, M. (2007). Reference Set Reduction Algorithms Based on Double Sorting. In: Kurzynski, M., Puchala, E., Wozniak, M., Zolnierek, A. (eds) Computer Recognition Systems 2. Advances in Soft Computing, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75175-5_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-75175-5_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75174-8
Online ISBN: 978-3-540-75175-5
eBook Packages: EngineeringEngineering (R0)