Abstract
All of the Prototype Reduction Schemes (PRS) which have been reported in the literature, process time-invariant data to yield a subset of prototypes that are useful in nearest-neighbor-like classification. In this paper, we suggest two time-varying PRS mechanisms which, in turn, are suitable for two distinct models of non-stationarity. In both of these models, rather than process all the data as a whole set using a PRS, we propose that the information gleaned from a previous PRS computation be enhanced to yield the prototypes for the current data set, and this enhancement is accomplished using a LVQ3-type “fine tuning”. The experimental results, which to our knowledge are the first reported results applicable for PRS schemes suitable for non-stationary data, are, in our opinion, very impressive.
The first author was partially supported by KOSEF, the Korea Science and Engineering Foundation, and the second author was partially supported by NSERC, Natural Sciences and Engineering Research Council of Canada.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bezdek, J.C., Kuncheva, L.I.: Nearest prototype classifier designs: An experimental study. Int’l. J. of Intell. Syst. 16(12), 1445–1473 (2001)
Chang, C.L.: Finding prototypes for nearest neighbour classifiers. IEEE Trans. Computers C-23(11), 1179–1184 (1974)
Dasarathy, B.V.: Nearest Neighbour (NN) Norms: NN Pattern Classification Techniques. IEEE Computer Society Press, Los Alamitos (1991)
Dasarathy, B.V.: Minimal Consistent Set (MCS) identification for optimal nearest neighbor decision systems design. IEEE Trans. Systems, Man, and Cybernetics 24(3), 511–517 (1994)
Devijver, P.A., Kittler, J.: On the edited nearest neighbour rule. In: Proc. 5th Int. Conf. on Pattern Recognition, December 1980, pp. 72–80 (1980)
Fukunaga, K., Mantock, J.M.: Nonparametric data reduction. IEEE Trans. Pattern Anal. and Machine Intell. PAMI-6(1), 115–118 (1984)
Gates, G.W.: The reduced nearest neighbour rule. IEEE Trans. Inform. Theory IT-18, 431–433 (1972)
Hart, P.E.: The condensed nearest neighbour rule. IEEE Trans. Inform. Theory IT-14, 515–516 (1968)
Hamamoto, Y., Uchimura, S., Tomita, S.: A bootstrap technique for nearest neighbour classifier design. IEEE Trans. Pattern Anal. and Machine Intell. PAMI-19(1), 73–79 (1997)
Kim, S.-W., Oommen, B.J.: Time-Varying Prototype Reduction Schemes Applicable for Non-stationary Data Sets. Pattern Recognition
Kim, S.-W., Oommen, B.J.: Enhancing prototype reduction schemes with LVQ3-type algorithms. Pattern Recognition 36(5), 1083–1093 (2003)
Kim, S.-W., Oommen, B.J.: A Brief Taxonomy and Ranking of Creative Prototype Reduction Schemes. Pattern Analysis and Applications 6(3), 232–244 (2003)
Kim, S.-W., Oommen, B.J.: Enhancing Prototype Reduction Schemes with Recursion: A Method Applicable for “Large” Data Sets. IEEE Trans. Systems, Man, and Cybernetics - Part B SMC-34(3), 1384–1397 (2004)
Ritter, G.L., Woodruff, H.B., Lowry, S.R., Isenhour, T.L.: An algorithm for a selective nearest neighbour rule. IEEE Trans. Inform. Theory IT-21, 665–669 (1975)
Tomek, I.: Two modifications of CNN. IEEE Trans. Syst., Man and Cybern. SMC-6(6), 769–772 (1976)
Xie, Q., Laszlo, C.A., Ward, R.K.: Vector quantization techniques for nonparametric classifier design. IEEE Trans. Pattern Anal. and Machine Intell. PAMI-15(12), 1326–1330 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, SW., Oommen, B.J. (2005). Time-Varying Prototype Reduction Schemes Applicable for Non-stationary Data Sets. In: Zhang, S., Jarvis, R. (eds) AI 2005: Advances in Artificial Intelligence. AI 2005. Lecture Notes in Computer Science(), vol 3809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11589990_64
Download citation
DOI: https://doi.org/10.1007/11589990_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30462-3
Online ISBN: 978-3-540-31652-7
eBook Packages: Computer ScienceComputer Science (R0)