Learning distance functions with side information plays a key role in many data mining applications. Conventional distance metric learning approaches often assume that the target distance function is represented in some form of Mahalanobis distance. These approaches usually work well when data are in low dimensionality, but often become computationally expensive or even infeasible when handling high-dimensional data. In this paper, we propose a novel scheme of learning nonlinear distance functions with side information. It aims to learn a Bregman distance function using a nonparametric approach that is similar to Support Vector Machines. We emphasize that the proposed scheme is more general than the conventional approach for distance metric learning, and is able to handle high-dimensional data efficiently. We verify the efficacy of the proposed distance learning method with extensive experiments on semi-supervised clustering. The comparison with state-of-the-art approaches for learning distance functions with side information reveals clear advantages of the proposed technique.
Bregman distance, convex functions, distance functions, metric learning
IEEE Transactions on Knowledge and Data Engineering (TKDE)
Wu, Lei; HOI, Chu Hong; Jin, Rong; Zhu, Jianke; and Yu, N..
Learning Bregman Distance Functions for Semi-Supervised Clustering. (2012). IEEE Transactions on Knowledge and Data Engineering (TKDE). 24, (3), 478-491. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/2282