Active and passive nearest neighbor algorithm: a newly-developed supervised classifier

Authors:
KaiYan Feng;JunHui Gao;KaiRui Feng;Lei Liu;YiXue Li
Affiliations:
Shanghai Center for Bioinformatics Technology, Shanghai, China;Shanghai Center for Bioinformatics Technology, Shanghai, China;Blades Enterprise Centre, Simcyp Limited, Sheffield, United Kingdom;Shanghai Center for Bioinformatics Technology, Shanghai, China;Shanghai Center for Bioinformatics Technology, Shanghai, China
Venue:
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
Year:
2011

Citing 3
Cited 0

The nature of statistical learning theory

The nature of statistical learning theory
Multiple Classifier Combination for Character Recognition: Revisiting the Majority Voting System and Its Variations

DAS '02 Proceedings of the 5th International Workshop on Document Analysis Systems V
The WEKA data mining software: an update

ACM SIGKDD Explorations Newsletter

Quantified Score

Hi-index	0.00

Visualization

Abstract

K nearest neighbor algorithm (k-NN) is an instance-based lazy classifier that does not need to delineate the entire boundaries between classes. Thus some classification tasks that constantly need a training procedure may favor k-NN if high efficiency is needed. However, k-NN is prone to be affected by the underlying data distribution. In this paper, we define a new neighborhood relationship, called passive nearest neighbors, which is deemed to be able to counteract with the variation of data densities. Based on which we develop a new classifier called active and passive nearest neighbor algorithm (APNNA). The classifier is evaluated by 10-fold cross-validation on 10 randomly chosen benchmark datasets. The experimental results show that APNNA performs better than other classifiers on some datasets and worse on some other datasets, indicating that APNNA is a good complement to the current state-of-the-art of classification.