Skip to main content
SpringerLink
Log in

Time-Varying Prototype Reduction Schemes Applicable for Non-stationary Data Sets

  • Conference paper
Book cover AI 2005: Advances in Artificial Intelligence (AI 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3809))

Included in the following conference series:

  • 1728 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bezdek, J.C., Kuncheva, L.I.: Nearest prototype classifier designs: An experimental study. Int’l. J. of Intell. Syst. 16(12), 1445–1473 (2001)

    Article  MATH  Google Scholar 

  2. Chang, C.L.: Finding prototypes for nearest neighbour classifiers. IEEE Trans. Computers C-23(11), 1179–1184 (1974)

    Article  MATH  Google Scholar 

  3. Dasarathy, B.V.: Nearest Neighbour (NN) Norms: NN Pattern Classification Techniques. IEEE Computer Society Press, Los Alamitos (1991)

    Google Scholar 

  4. 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)

    Article  Google Scholar 

  5. 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)

    Google Scholar 

  6. Fukunaga, K., Mantock, J.M.: Nonparametric data reduction. IEEE Trans. Pattern Anal. and Machine Intell. PAMI-6(1), 115–118 (1984)

    Article  Google Scholar 

  7. Gates, G.W.: The reduced nearest neighbour rule. IEEE Trans. Inform. Theory IT-18, 431–433 (1972)

    Article  Google Scholar 

  8. Hart, P.E.: The condensed nearest neighbour rule. IEEE Trans. Inform. Theory IT-14, 515–516 (1968)

    Article  Google Scholar 

  9. 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)

    Article  Google Scholar 

  10. http://cochlea.hut.fi/research/som_lvq_pak.shtml

  11. http://svm.research.bell-labs.com/SVMdoc.html

  12. http://www.ics.uci.edu/mlearn/MLRepository.html

  13. Kim, S.-W., Oommen, B.J.: Time-Varying Prototype Reduction Schemes Applicable for Non-stationary Data Sets. Pattern Recognition

    Google Scholar 

  14. Kim, S.-W., Oommen, B.J.: Enhancing prototype reduction schemes with LVQ3-type algorithms. Pattern Recognition 36(5), 1083–1093 (2003)

    Article  MATH  Google Scholar 

  15. 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)

    Article  MathSciNet  Google Scholar 

  16. 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)

    Article  Google Scholar 

  17. 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)

    Article  MATH  Google Scholar 

  18. Tomek, I.: Two modifications of CNN. IEEE Trans. Syst., Man and Cybern. SMC-6(6), 769–772 (1976)

    MATH  Google Scholar 

  19. 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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IEEE, Dept. of Computer Science and Engineering, Myongji University, Yongin, 449-728, Korea

    Sang-Woon Kim

  2. IEEE, School of Computer Science, Carleton University, Ottawa, ON, K1S 5B6, Canada

    B. John Oommen

Authors
  1. Sang-Woon Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. John Oommen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Guangxi Normal University, College of CS and IT, Guilin, China, and University of Technology, Faculty of Engineering and Information Technology, Sydney, Australia

    Shichao Zhang

  2. Department of Electrical and Computer Systems Engineering, Monash University, 3800, Melbourne, Victoria, Australia

    Ray Jarvis

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation