Constrained spectral clustering through affinity propagation

Pairwise constraints specify whether or not two samples should be in one cluster. Although it has been successful to incorporate them into traditional clustering methods, such as K-means, little progress has been made in combining them with spectral clustering. The major challenge in designing an effective constrained spectral clustering is a sensible combination of the scarce pairwise constraints with the original affinity matrix. We propose to combine the two sources of affinity by propagating the pairwise constraints information over the original affinity matrix. Our method has a Gaussian process interpretation and results in a closed-form expression for the new affinity matrix. Experiments show it outperforms state-of-the-art constrained clustering methods in getting good clusterings with fewer constraints, and yields good image segmentation with userspecified pairwise constraints. There is an emerging interest in incorporating pairwise constraints into clustering algorithms in th...

• Type: Conference
• Year: 2008
• Where: CVPR
• Authors: Miguel Á. Carreira-Perpiñán, Zhengdong Lu
• Keywords: Cannot-link Constraints, Computer Vision, CVPR 2008, Fewer Constraints, Pairwise Constraints, Pairwise Constraints Information, Scarce Pairwise Constraints