Abstract

Linear metric learning is a widely used methodology to learn a dissimilarity function from a set of similar/dissimilar example pairs. Us- ing a single metric may be a too restrictive assumption when handling heterogeneous datasets. Recently, local metric learning methods have been introduced to overcome this limitation. However, they are sub jects to constraints preventing their usage in many applications. For example, they require knowledge of the class label of the training points. In this paper, we present a novel local metric learning method, which overcomes some limitations of previous approaches. The method first computes a Gaussian Mixture Model from a low dimensional embedding of train- ing data. Then it estimates a set of local metrics by solving a convex optimization problem; finally, a dissimilarity function is obtained by ag- gregating the local metrics. Our experiments show that the proposed method achieves state-of-the-art results on four datasets.