An Analysis of Order Dependence in k-NN

  • David McSherry
  • Christopher Stretch
Conference paper

DOI: 10.1007/978-3-642-17080-5_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6206)
Cite this paper as:
McSherry D., Stretch C. (2010) An Analysis of Order Dependence in k-NN. In: Coyle L., Freyne J. (eds) Artificial Intelligence and Cognitive Science. AICS 2009. Lecture Notes in Computer Science, vol 6206. Springer, Berlin, Heidelberg

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.

Keywords

classification k-NN instance-based learning case-based reasoning 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • David McSherry
    • 1
  • Christopher Stretch
    • 1
  1. 1.School of Computing and Information EngineeringUniversity of UlsterColeraineNorthern Ireland

Personalised recommendations