Loading...

Metric learning for semi-supervised clustering using pairwise constraints and the geometrical structure of data

Baghshah Soleymani, B ; Sharif University of Technology

271 Viewed
  1. Type of Document: Article
  2. DOI: 10.3233/IDA-2009-0399
  3. Abstract:
  4. Metric learning is a powerful approach for semi-supervised clustering. In this paper, a metric learning method considering both pairwise constraints and the geometrical structure of data is introduced for semi-supervised clustering. At first, a smooth metric is found (based on an optimization problem) using positive constraints as supervisory information. Then, an extension of this method employing both positive and negative constraints is introduced. As opposed to the existing methods, the extended method has the capability of considering both positive and negative constraints while considering the topological structure of data. The proposed metric learning method can improve performance of semi-supervised clustering algorithms. Experimental results on real-world data sets show the effectiveness of this method. © 2009 - IOS Press and the authors. All rights reserved
  5. Keywords:
  6. Constraints ; Laplacian ; Metric learning ; Semi-supervised clustering
  7. Source: Intelligent Data Analysis ; Volume 13, Issue 6 , 2009 , Pages 887-899 ; 1088467X (ISSN)
  8. URL: https://content.iospress.com/articles/intelligent-data-analysis/ida00399