Efficient Kernel Learning from Constraints and Unlabeled Data
Mahdieh Soleymani Baghshah, Saeed Bagheri Shouraki · 2010
Recently, distance metric learning has been received an increasing attention and found as a powerful approach for semi-supervised learning tasks. In the last few years, several methods have been proposed for metric learning when must-link and/or cannot-link constraints as supervisory information are available. Although many of these methods learn global Mahalanobis metrics, some recently introduced methods have tried to learn more flexible distance metrics using a kernel-based approach. In this paper, we consider the problem of kernel learning from both pairwise constraints and unlabeled data. We propose a method that adapts a flexible distance metric via learning a nonparametric kernel matrix. We formulate our method as an optimization problem that can be solved efficiently. Experimental evaluations show the effectiveness of our method compared to some recently introduced methods on a variety of data sets.