Weighted K-Nearest Neighbor revisited
- 1 December 2016
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1642-1647
- https://doi.org/10.1109/icpr.2016.7899872
Abstract
In this paper we show that weighted K-Nearest Neighbor, a variation of the classic K-Nearest Neighbor, can be reinterpreted from a classifier combining perspective, specifically as a fixed combiner rule, the sum rule. Subsequently, we experimentally demonstrate that it can be rather beneficial to consider other combining schemes as well. In particular, we focus on trained combiners and illustrate the positive effect these can have on classification performance.Keywords
This publication has 10 references indexed in Scilit:
- Optimal weighted nearest neighbour classifiersThe Annals of Statistics, 2012
- A theoretical and experimental analysis of linear combiners for multiple classifier systemsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2005
- Combining Pattern ClassifiersPublished by Wiley ,2004
- The combining classifier: to train or not to train?Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Decision templates for multiple classifier fusion: an experimental comparisonPattern Recognition, 2001
- On combining classifiersIeee Transactions On Pattern Analysis and Machine Intelligence, 1998
- Stacked generalizationNeural Networks, 1992
- A Re-Examination of the Distance-Weighted k-Nearest Neighbor Classification RuleIEEE Transactions on Systems, Man, and Cybernetics, 1987
- The Distance-Weighted k-Nearest-Neighbor RuleIEEE Transactions on Systems, Man, and Cybernetics, 1976
- Nearest neighbor pattern classificationIEEE Transactions on Information Theory, 1967