Finding small consistent subset for the nearest neighbor classifier based on support graphs

Milton García-Boroto, Yenny Villuendas-Rey, Jesús Ariel Carrasco-Ochoa, José Fco. Martínez-Trinidad

Producción científica: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

4 Citas (Scopus)

Resumen

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.

Idioma originalInglés
Título de la publicación alojadaProgress in Pattern Recognition, Image Analysis, Computer Vision and Applications - 14th Iberoamerican Conference on Pattern Recognition, CIARP 2009, Proceedings
Páginas465-472
Número de páginas8
DOI
EstadoPublicada - 2009
Publicado de forma externa
Evento14th Iberoamerican Conference on Pattern Recognition, CIARP 2009 - Guadalajara, Jalisco, México
Duración: 15 nov. 200918 nov. 2009

Serie de la publicación

NombreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen5856 LNCS
ISSN (versión impresa)0302-9743
ISSN (versión digital)1611-3349

Conferencia

Conferencia14th Iberoamerican Conference on Pattern Recognition, CIARP 2009
País/TerritorioMéxico
CiudadGuadalajara, Jalisco
Período15/11/0918/11/09

Huella

Profundice en los temas de investigación de 'Finding small consistent subset for the nearest neighbor classifier based on support graphs'. En conjunto forman una huella única.

Citar esto