.png){kind=icon}
返回
Fast neighborhood component analysis
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2011.10.021.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Distance metric is of considerable importance in varieties of machine learning and pattern recognition applications. Neighborhood component analysis (NCA), one of the most successful metric learning algorithms, suffers from the high computational cost, which makes it only suitable for small-scale classification tasks. To overcome this disadvantage, we proposed a fast neighborhood component analysis (FNCA) method. For a given sample, FNCA adopts a local probability distribution model constructed based on its K nearest neighbors from the same class and from the different classes. We further extended FNCA to nonlinear metric learning scenarios using the kernel trick. Experimental results show that, compared with NCA, FNCA not only significantly increases the training speed but also obtains higher classification accuracy. Furthermore, comparative studies with the state-of-the-art approaches on various real-world datasets also verify the effectiveness of the proposed linear and nonlinear FNCA methods. (C) 2011 Elsevier B.V. All rights reserved.
Keyword:
Metric learning
Nearest neighbor
Dimensionality reduction
Kernel method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Substrate Selectivity of a Novel Amylo-α-1,6-glucosidase from Thermococcus gammatolerans STB12.png)
Foods
OAAI
FoodsIF0
OAAI分享收藏分享收藏A general kernelization framework for learning algorithms based on kernel PCANEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏分享收藏分享收藏
查看更多内容