On the Use of Different Classification Rules in an Editing Task
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.
KeywordsPattern recognition classification nearest neighbor prototype selection editing
- 1.Bernardo, E., Ho, T.-K.: On classifier domain of competence. In: Proc. 17th. Int. Conf. on Pattern Recognition, Cambridge, UK, pp. 136–139 (2004)Google Scholar
- 7.Dasarathy, B.V.: Nearest Neighbor Norms: NN Pattern Classification techniques. IEEE Computer Society Press, Los Alamos (1991)Google Scholar