Generalized sparse metric learning with relative comparisons
Huang, Kaizhu1; Ying, Yiming2; Campbell, Colin3
发表期刊KNOWLEDGE AND INFORMATION SYSTEMS
2011-07-01
卷号28期号:1页码:25-45
文章类型Article
摘要The objective of sparse metric learning is to learn a distance measure from a set of data in addition to finding a low-dimensional representation. Despite demonstrated success, the performance of existing sparse metric learning approaches is usually limited because the methods assumes certain problem relaxations or they target the SML objective indirectly. In this paper, we propose a Generalized Sparse Metric Learning method. This novel framework offers a unified view for understanding many existing sparse metric learning algorithms including the Sparse Metric Learning framework proposed in (Rosales and Fung ACM International conference on knowledge discovery and data mining (KDD), pp 367-373, 2006), the Large Margin Nearest Neighbor (Weinberger et al. in Advances in neural information processing systems (NIPS), 2006; Weinberger and Saul in Proceedings of the twenty-fifth international conference on machine learning (ICML-2008), 2008), and the D-ranking Vector Machine (D-ranking VM) (Ouyang and Gray in Proceedings of the twenty-fifth international conference on machine learning (ICML-2008), 2008). Moreover, GSML also establishes a close relationship with the Pairwise Support Vector Machine (Vert et al. in BMC Bioinform, 8, 2007). Furthermore, the proposed framework is capable of extending many current non-sparse metric learning models to their sparse versions including Relevant Component Analysis (Bar-Hillel et al. in J Mach Learn Res, 6:937-965, 2005) and a state-of-the-art method proposed in (Xing et al. Advances in neural information processing systems (NIPS), 2002). We present the detailed framework, provide theoretical justifications, build various connections with other models, and propose an iterative optimization method, making the framework both theoretically important and practically scalable for medium or large datasets. Experimental results show that this generalized framework outperforms six state-of-the-art methods with higher accuracy and significantly smaller dimensionality for seven publicly available datasets.
关键词Generalized Framework Metric Learning Sparse
WOS标题词Science & Technology ; Technology
关键词[WOS]DIMENSIONALITY REDUCTION ; MACHINE
收录类别SCI
语种英语
WOS研究方向Computer Science
WOS类目Computer Science, Artificial Intelligence ; Computer Science, Information Systems
WOS记录号WOS:000292047400002
引用统计
被引频次:18[WOS]   [WOS记录]     [WOS相关记录]
文献类型期刊论文
条目标识符http://ir.ia.ac.cn/handle/173211/3063
专题模式识别国家重点实验室_模式分析与学习
作者单位1.Chinese Acad Sci, Inst Automat, Natl Lab Pattern Recognit, Beijing 100190, Peoples R China
2.Univ Exeter, Sch Engn Comp & Math, Exeter EX4 4QF, Devon, England
3.Univ Bristol, Dept Engn Math, Bristol BS8 1TR, Avon, England
第一作者单位模式识别国家重点实验室
推荐引用方式
GB/T 7714
Huang, Kaizhu,Ying, Yiming,Campbell, Colin. Generalized sparse metric learning with relative comparisons[J]. KNOWLEDGE AND INFORMATION SYSTEMS,2011,28(1):25-45.
APA Huang, Kaizhu,Ying, Yiming,&Campbell, Colin.(2011).Generalized sparse metric learning with relative comparisons.KNOWLEDGE AND INFORMATION SYSTEMS,28(1),25-45.
MLA Huang, Kaizhu,et al."Generalized sparse metric learning with relative comparisons".KNOWLEDGE AND INFORMATION SYSTEMS 28.1(2011):25-45.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Huang, Kaizhu]的文章
[Ying, Yiming]的文章
[Campbell, Colin]的文章
百度学术
百度学术中相似的文章
[Huang, Kaizhu]的文章
[Ying, Yiming]的文章
[Campbell, Colin]的文章
必应学术
必应学术中相似的文章
[Huang, Kaizhu]的文章
[Ying, Yiming]的文章
[Campbell, Colin]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。