Locally linear reconstruction for instance-based learning

Pilsung Kang, Sungzoon Cho

Research output: Contribution to journalArticle

48 Citations (Scopus)

Abstract

Instance-based learning (IBL), so called memory-based reasoning (MBR), is a commonly used non-parametric learning algorithm. k-nearest neighbor (k-NN) learning is the most popular realization of IBL. Due to its usability and adaptability, k-NN has been successfully applied to a wide range of applications. However, in practice, one has to set important model parameters only empirically: the number of neighbors (k) and weights to those neighbors. In this paper, we propose structured ways to set these parameters, based on locally linear reconstruction (LLR). We then employed sequential minimal optimization (SMO) for solving quadratic programming step involved in LLR for classification to reduce the computational complexity. Experimental results from 11 classification and eight regression tasks were promising enough to merit further investigation: not only did LLR outperform the conventional weight allocation methods without much additional computational cost, but also LLR was found to be robust to the change of k.

Original languageEnglish
Pages (from-to)3507-3518
Number of pages12
JournalPattern Recognition
Volume41
Issue number11
DOIs
Publication statusPublished - 2008 Nov 1
Externally publishedYes

Keywords

  • Instance-based learning
  • k-nearest neighbor
  • Local reconstruction
  • Memory-based reasoning
  • Weight allocation

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Locally linear reconstruction for instance-based learning'. Together they form a unique fingerprint.

  • Cite this