Constraints as features

Shmuel Asafi, Daniel Cohen-Or

Research output: Contribution to journalConference articlepeer-review


In this paper, we introduce a new approach to constrained clustering which treats the constraints as features. Our method augments the original feature space with additional dimensions, each of which derived from a given Cannot-link constraints. The specified Cannot-link pair gets extreme coordinates values, and the rest of the points get coordinate values that express their spatial influence from the specified constrained pair. After augmenting all the new features, a standard unconstrained clustering algorithm can be performed, like k-means or spectral clustering. We demonstrate the efficacy of our method for active semi-supervised learning applied to image segmentation and compare it to alternative methods. We also evaluate the performance of our method on the four most commonly evaluated datasets from the UCI machine learning repository.

Original languageEnglish
Article number6619058
Pages (from-to)1634-1641
Number of pages8
JournalProceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
StatePublished - 2013
Event26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2013 - Portland, OR, United States
Duration: 23 Jun 201328 Jun 2013


  • clustering
  • image segmentation
  • machine learning
  • semi-supervised


Dive into the research topics of 'Constraints as features'. Together they form a unique fingerprint.

Cite this