Semi-Supervised Clustering with Metric Learning using Relative Comparisons Nimit Kumar, Krishna Kummamuru, and Deepa Paranjpe   View Paper (PDF)   Return to Session 13: Learning Techniques II Abstract Semi-supervised clustering algorithms partition a given data set using limited supervision from the user. In this paper, we propose a clustering algorithmthat uses supervision in terms of relative comparisons, viz., is closer to than to . The success of a clustering algorithm also depends on the kind of dissimilarity measure. The proposed clustering algorithm learns the underlying dissimilarity measure while finding compact clusters in the given data set. Through our experimental studies on high-dimensional textual data sets, we demonstrate that the proposed algorithm achieves higher accuracy than the algorithms using pairwise constraints for supervision. ©2006 Association for Computing Machinery