On the Selection of the Globally Optimal Prototype Subset for Nearest-Neighbor Classification

The nearest-neighbor classifier has been shown to be a powerful tool for multiclass classification. We explore both theoretical properties and empirical behavior of a variant method, in which the nearest-neighbor rule is applied to a reduced set of prototypes. This set is selected a priori by fixing...

ver descrição completa

Detalhes bibliográficos
Autores: Carrizosa Priego, Emilio José, Martín Barragán, Belén, Plastria, Frank, Romero Morales, María Dolores
Formato: artículo
Estado:Versión publicada
Fecha de publicación:2007
País:España
Recursos:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/107714
Acesso em linha:https://hdl.handle.net/11441/107714
https://doi.org/10.1287/ijoc.1060.0183
Access Level:acceso abierto
Palavra-chave:classification
optimal prototype subset
nearest neighbor
dissimilarities
integer programming
variable neighborhood search
missing values
Descrição
Resumo:The nearest-neighbor classifier has been shown to be a powerful tool for multiclass classification. We explore both theoretical properties and empirical behavior of a variant method, in which the nearest-neighbor rule is applied to a reduced set of prototypes. This set is selected a priori by fixing its cardinality and minimizing the empirical misclassification cost. In this way we alleviate the two serious drawbacks of the nearest-neighbor method: high storage requirements and time-consuming queries. Finding this reduced set is shown to be NP-hard. We provide mixed integer programming (MIP) formulations, which are theoretically compared and solved by a standard MIP solver for small problem instances. We show that the classifiers derived from these formulations are comparable to benchmark procedures. We solve large problem instances by a metaheuristic that yields good classification rules in reasonable time. Additional experiments indicate that prototype-based nearest-neighbor classifiers remain quite stable in the presence of missing values.