Please use this identifier to cite or link to this item:
|Title:||Positive semidefinite metric learning using boosting-like algorithms|
Van Den Hengel, A.
|Citation:||Journal of Machine Learning Research, 2012; 13(0):1007-1036|
|Chunhua Shen, Junae Kim, Lei Wang, Anton van den Hengel|
|Abstract:||The success of many machine learning and pattern recognition methods relies heavily upon the identification of on an appropriate distance metric on the input data. It is often beneficial to learn such a metric from the input training data, instead of using a default one such as the Euclidean distance. In this work, we propose a boosting-based technique, termed BoostMetric, for learning a quadratic Mahalanobis distance metric. Learning a valid Mahalanobis distance metric requires enforcing the constraint that the matrix parameter to the metric remains positive semidefinite. Semidefinite programming is often used to enforce this constraint, but does not scale well and not easy to implement. BoostMetric is instead based on the observation that any positive semidefinite matrix can be decomposed into a linear combination of trace-one rank-one matrices. BoostMetric thus uses rank-one positive semidefinite matrices as weak learners within an efficient and scalable boosting-based learning process. The resulting methods are easy to implement, efficient, and can accommodate various types of constraints. We extend traditional boosting algorithms in that its weak learner is a positive semidefinite matrix with trace and rank being one rather than a classifier or regressor. Experiments on various datasets demonstrate that the proposed algorithms compare favorably to those state-of-the-art methods in terms of classification accuracy and running time.|
large margin nearest neighbor.
|Rights:||© 2012 Chunhua Shen, Junae Kim, Lei Wang, and Anton van den Hengel.|
|Appears in Collections:||Aurora harvest|
Computer Science publications
Files in This Item:
|hdl_70243.pdf||Published version||520.18 kB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.