Skip to main content

Experimental investigation on editing for the k-NN rule through a genetic algorithm

  • Posters
  • Conference paper
  • First Online:
Computer Analysis of Images and Patterns (CAIP 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 970))

Included in the following conference series:

  • 142 Accesses

Abstract

An experimental investigation on selection of a reference set for the k-Nearest Neighbors (k-NN) classification method has been conducted. Genetic algorithms have been employed bringing together the strategy to preserve the decision boundary and that of selecting the most ”typical” objects as prototypes. The chromosome is directly mapped onto the reference set and the best subset is subsequently evolved. Two fitness functions have been examined. The results are contrasted with those obtained with the whole sample (before editing), Hart's and Wilson's methods. Independent subsets have been used for training and for test. Two data sets were used: two highly overlapping Gaussian classes and a data set from neonatology. The results with the proposed editing technique compare favorably with those obtained with the classical methods and with the non-edited sample.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dasarathy B.V. (1990) Nearest Neighbor (NN) Norms: NN Pattern Classification Techniques, IEEE Computer Society Press, Los Alamitos, Calofornia, 1990.

    Google Scholar 

  2. Devijver P., J. Kittler (1982) Pattern Recognition. A statistical approach, Prentice Hall Int.

    Google Scholar 

  3. Hart P.E. (1968) The condensed nearest neighbor rule, IEEE Transactions on Information Theory, IT-16, 515–516.

    Google Scholar 

  4. Kuncheva L.I. (1994) Selection of a k-NN reference set by genetic algorithm and index of fuzziness, Proc. Second European Conference on Fuzzy and Intelligent Technologies, EUFIT'94, Aachen, Germany, 640–644.

    Google Scholar 

  5. Kuncheva L.I. (1994) Editing for the k-nearest neighbors rile by a genetic algorithm, Pattern Recognition Letters, to appear.

    Google Scholar 

  6. Wilson D.L. (1972) Asymptotic properties of nearest neighbor rules using edited data, IEEE Transactions on Systems, Man, and Cybernetics, SMC-2, 408–421.

    Google Scholar 

  7. Yang M.-S., C.-T. Chen. (1993) On strong consistency of the fuzzy generalized nearest neighbor rule, Fuzzy Sets and Systems, 60, 273–281.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Václav Hlaváč Radim Šára

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kuncheva, L.I., Yotzov, Y.K. (1995). Experimental investigation on editing for the k-NN rule through a genetic algorithm. In: Hlaváč, V., Šára, R. (eds) Computer Analysis of Images and Patterns. CAIP 1995. Lecture Notes in Computer Science, vol 970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60268-2_378

Download citation

  • DOI: https://doi.org/10.1007/3-540-60268-2_378

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60268-2

  • Online ISBN: 978-3-540-44781-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics