返回
Bayesian instance selection for the nearest neighbor rule
DOI:10.1007/s10994-010-5170-2.png)
摘要
En 中文
The nearest neighbors rules are commonly used in pattern recognition and statistics. The performance of these methods relies on three crucial choices: a distance metric, a set of prototypes and a classification scheme. In this paper, we focus on the second, challenging issue: instance selection. We apply a maximum a posteriori criterion to the evaluation of sets of instances and we propose a new optimization algorithm. This gives birth to Eva, a new instance selection method. We benchmark this method on real datasets and perform a multi-criteria analysis: we evaluate the compression rate, the predictive accuracy, the reliability and the computational time. We also carry out experiments on synthetic datasets in order to discriminate the respective contributions of the criterion and the algorithm, and to illustrate the advantages of Eva over the state-of-the-art algorithms. The study shows that Eva outputs smaller and more reliable sets of instances, in a competitive time, while preserving the predictive accuracy of the related classifier.
Keyword:
Nearest neighbor
Instance selection
Voronoi tesselation
Maximum a posteriori
期刊
IF:
2.9
论文数:
2.7K
被引数:
3.4W
机构
引用论文
Impacts of event-specific air quality improvements on total hospital admissions and reduced systemic inflammation in COPD patients
PLOS ONE
IF0
Dysfunctions of decision‐making and cognitive control as transdiagnostic mechanisms of mental disorders: advances, gaps, and needs in current research作为精神障碍的跨诊断机制的决策和认知控制功能障碍: 当前研究的进展,差距和需求

