Skip to main navigation Skip to search Skip to main content

Improved kNN rule for small training sets

  • Sunsern Cheamanunkul
  • , Yoav Freund
  • UC San Diego

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Citations (Scopus)

Abstract

The traditional k-NN classification rule predicts a label based on the most common label of the k nearest neighbors (the plurality rule). It is known that the plurality rule is optimal when the number of examples tends to infinity. In this paper we show that the plurality rule is sub-optimal when the number of labels is large and the number of examples is small. We propose a simple k-NN rule that takes into account the labels of all of the neighbors, rather than just the most common label. We present a number of experiments on both synthetic datasets and real-world datasets, including MNIST and SVHN. We show that our new rule can achieve lower error rates compared to the majority rule in many cases.

Original languageEnglish
Title of host publicationProceedings - 2014 13th International Conference on Machine Learning and Applications, ICMLA 2014
EditorsXue-wen Chen, Guangzhi Qu, Plamen Angelov, Cesar Ferri, Jian-Huang Lai, M. Arif Wani
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages201-206
Number of pages6
ISBN (Electronic)9781479974153
DOIs
Publication statusPublished - 5 Feb 2014
Externally publishedYes
Event13th International Conference on Machine Learning and Applications, ICMLA 2014 - Detroit, United States
Duration: 3 Dec 2014 → 6 Dec 2014

Publication series

NameProceedings - 2014 13th International Conference on Machine Learning and Applications, ICMLA 2014

Conference

Conference13th International Conference on Machine Learning and Applications, ICMLA 2014
Country/TerritoryUnited States
CityDetroit
Period3/12/14 → 6/12/14

Fingerprint

Dive into the research topics of 'Improved kNN rule for small training sets'. Together they form a unique fingerprint.

Cite this