On the use of different classification rules in an editing task

  • Authors:
  • Luisa Micó;Francisco Moreno-Seco;José Salvador Sánchez;José Martinez Sotoca;Ramón Alberto Mollineda

  • Affiliations:
  • Dept. Llenguatges i Sistemes Informàtics, Universitat d’Alacant, Alacant, Spain;Dept. Llenguatges i Sistemes Informàtics, Universitat d’Alacant, Alacant, Spain;Dept. Llenguatges i Sistemes Informàtics, Universitat Jaume I, Castelló de la Plana, Spain;Dept. Llenguatges i Sistemes Informàtics, Universitat Jaume I, Castelló de la Plana, Spain;Dept. Llenguatges i Sistemes Informàtics, Universitat Jaume I, Castelló de la Plana, Spain

  • Venue:
  • SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Editing allows the selection of a representative subset of prototypes among the training sample to improve the performance of a classification task. The Wilson’s editing algorithm was the first proposal and then a great variety of new editing techniques have been proposed based on it. This algorithm consists on the elimination of prototypes in the training set that are misclassified using the k-NN rule. From such editing scheme, a general editing procedure can be straightforward derived, where any classifier beyond k-NN can be used. In this paper, we analyze the behavior of this general editing procedure combined with 3 different neighborhood-based classification rules, including k-NN. The results reveal better performances of the 2 other techniques with respect to k-NN in most of cases.