Simple incremental instance selection wrapper for classification

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Instance selection methods are very useful data mining tools for dealing with large data sets. There exist many instance selection algorithms capable for significant reduction of training data size for particular classifier without generalization degradation. In opposition to those methods, this paper focuses on general pruning methods which can be successfully applied for arbitrary classification method. Simple but efficient wrapper method based on generalization of Hart's Condensed Nearest Neighbors rule is presented and impact of this method on classification quality is reported. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Grochowski, M. (2012). Simple incremental instance selection wrapper for classification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7268 LNAI, pp. 64–72). Springer Verlag. https://doi.org/10.1007/978-3-642-29350-4_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free