跳到主要导航 跳到搜索 跳到主要内容

Fast LMNN Algorithm through Random Sampling

  • Beihang University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

The Large Margin Nearest Neighbor (LMNN) metric learning algorithm has been successfully used in many applications and continuously motivates new research works. However, the high computational complexity of training the LMNN algorithm inherent from the k-Nearest Neighbor (kNN) search makes it inapplicable to large datasets, especially when we need to tune the hyper-parameters of the LMNN algorithm. In this paper, we present the fast LMNN algorithm through random sampling. Random sampling method reduces the number of samples that needs to be considered and therefore greatly reduces the computational complexity of training the LMNN algorithm. Our experiments show that when the sample rate is 10%, the performance of LMNN algorithm is nearly the same to training on all data samples while the training time is only 8% to 40% of training on all data samples. We further show that random sampling method can efficiently tune the hyper-parameters of the LMNN algorithm.

源语言英语
主期刊名Proceedings - 15th IEEE International Conference on Data Mining Workshop, ICDMW 2015
编辑Xindong Wu, Alexander Tuzhilin, Hui Xiong, Jennifer G. Dy, Charu Aggarwal, Zhi-Hua Zhou, Peng Cui
出版商Institute of Electrical and Electronics Engineers Inc.
871-876
页数6
ISBN(电子版)9781467384926
DOI
出版状态已出版 - 29 1月 2016
活动15th IEEE International Conference on Data Mining Workshop, ICDMW 2015 - Atlantic City, 美国
期限: 14 11月 201517 11月 2015

出版系列

姓名Proceedings - 15th IEEE International Conference on Data Mining Workshop, ICDMW 2015

会议

会议15th IEEE International Conference on Data Mining Workshop, ICDMW 2015
国家/地区美国
Atlantic City
时期14/11/1517/11/15

指纹

探究 'Fast LMNN Algorithm through Random Sampling' 的科研主题。它们共同构成独一无二的指纹。

引用此