Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data

Abstract

The problem of clustering with side information has received much recent attention and metric learning has been considered as a powerful approach to this problem. Until now, various metric learning methods have been proposed for semi-supervised clustering. Although some of the existing methods can use both positive (must-link) and negative (cannot-link… (More)
DOI: 10.1016/j.patcog.2010.02.022

Topics

11 Figures and Tables

Slides referencing similar topics