An analysis of order dependence in k-NN

Authors:
David McSherry;Christopher Stretch
Affiliations:
School of Computing and Information Engineering, University of Ulster, Coleraine, Northern Ireland;School of Computing and Information Engineering, University of Ulster, Coleraine, Northern Ireland
Venue:
AICS'09 Proceedings of the 20th Irish conference on Artificial intelligence and cognitive science
Year:
2009

Citing 7
Cited 0

Machine Learning

Machine Learning
Pattern Recognition and Neural Networks

Pattern Recognition and Neural Networks
Learning in Humans and Machines

Learning in Humans and Machines
Diversity-Conscious Retrieval

ECCBR '02 Proceedings of the 6th European Conference on Advances in Case-Based Reasoning
Top 10 algorithms in data mining

Knowledge and Information Systems
Case Provenance: The Value of Remembering Case Sources

ICCBR '07 Proceedings of the 7th international conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
A study of cross-validation and bootstrap for accuracy estimation and model selection

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

In classification based on k-NN with majority voting, the class assigned to a given problem is the one that occurs most frequently in the k most similar cases (or instances) in the dataset. However, different versions of k-NN may use different strategies to select the cases on which the solution is based when there are ties for the kth most similar case. One strategy is to break ties for the kth most similar case based on the ordering of cases in the dataset. We present an analysis of the order dependence introduced by this strategy and its effects on the algorithm's performance.