期刊
PATTERN RECOGNITION
卷 45, 期 2, 页码 844-862出版社
ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2011.07.026
关键词
Distance metric learning; Hypothesis margins; Boosting approaches
资金
- National Science Council [NSC 99-2221-E-019-036]
- [NTOU-RD981-05-02-04-01]
Determining a proper distance metric is often a crucial step for machine learning. In this paper, a boosting algorithm is proposed to learn a Mahalanobis distance metric. Similar to most boosting algorithms, the proposed algorithm improves a loss function iteratively. In particular, the loss function is defined in terms of hypothesis margins, and a metric matrix base-learner specific to the boosting framework is also proposed. Experimental results show that the proposed approach can yield effective Mahalanobis distance metrics for a variety of data sets, and demonstrate the feasibility of the proposed approach. (C) 2011 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据