arrow
返回

Locally linear reconstruction for instance-based learning

delete2008-11-01
delete56
PRE
AI
P
Pilsung Kang
S
Sungzoon Cho *
DOI:10.1016/j.patcog.2008.04.009delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
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.
Keyword:
instance-based learning
memory-based reasoning
k-nearest neighbor
weight allocation
local reconstruction
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Pattern Recognition 封面图
Pattern Recognition
IF:
7.6
论文数:
1.3W
被引数:
4.5W

机构

S
seoul national university (snu)
学者数:
7.2W
论文数: 6.6W
被引数: 86
引用论文

引用论文

err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容