Journal
PATTERN RECOGNITION
Volume 41, Issue 11, Pages 3507-3518Publisher
ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2008.04.009
Keywords
instance-based learning; memory-based reasoning; k-nearest neighbor; weight allocation; local reconstruction
Funding
- Korea Science and Engineering Foundation (KOSEF)
- Korea government [R01-2005-000-103900-0]
- Engineering Research Institute of SNU
Ask authors/readers for more resources
Instance-based learning (IBL), so called memory-based reasoning (MBR), is a commonly used nonparametric 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. (C) 2008 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available