SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Floating search methods in feature selection
Pattern Recognition Letters
Combining Pattern Classifiers: Methods and Algorithms
Combining Pattern Classifiers: Methods and Algorithms
The Generalized Condensed Nearest Neighbor Rule as A Data Reduction Method
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 02
Learning embeddings for indexing, retrieval, and classification, with applications to object and shape recognition in image databases
Improved heterogeneous distance functions
Journal of Artificial Intelligence Research
Selecting prototypes in mixed incomplete data
CIARP'05 Proceedings of the 10th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis and Applications
Intelligent feature and instance selection to improve nearest neighbor classifiers
MICAI'12 Proceedings of the 11th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
Hi-index | 0.00 |
Finding a minimal subset of objects that correctly classify the training set for the nearest neighbors classifier has been an active research area in Pattern Recognition and Machine Learning communities for decades. Although finding the Minimal Consistent Subset is not feasible in many real applications, several authors have proposed methods to find small consistent subsets. In this paper, we introduce a novel algorithm for this task, based on support graphs. Experiments over a wide range of repository databases show that our algorithm finds consistent subsets with lower cardinality than traditional methods.