A Stochastic Approach to Wilson’s Editing Algorithm

  • Fernando Vázquez
  • J. Salvador Sánchez
  • Filiberto Pla
Conference paper

DOI: 10.1007/11492542_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3523)
Cite this paper as:
Vázquez F., Sánchez J.S., Pla F. (2005) A Stochastic Approach to Wilson’s Editing Algorithm. In: Marques J.S., Pérez de la Blanca N., Pina P. (eds) Pattern Recognition and Image Analysis. IbPRIA 2005. Lecture Notes in Computer Science, vol 3523. Springer, Berlin, Heidelberg

Abstract

Two extensions of the original Wilson’s editing method are introduced in this paper. These new algorithms are based on estimating probabilities from the k-nearest neighbor patterns of an instance, in order to obtain more compact edited sets while maintaining the classification rate. Several experiments with synthetic and real data sets are carried out to illustrate the behavior of the algorithms proposed here and compare their performance with that of other traditional techniques.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Fernando Vázquez
    • 1
  • J. Salvador Sánchez
    • 2
  • Filiberto Pla
    • 2
  1. 1.Dept de Ciencia de la ComputaciónUniversidad de OrienteSantiago de CubaCuba
  2. 2.Dept. Lenguajes y Sistemas InformáticosUniversitat Jaume ICastellónSpain

Personalised recommendations