Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Clustering with Instance-level Constraints
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Segmentation Given Partial Grouping Constraints
IEEE Transactions on Pattern Analysis and Machine Intelligence
Clustering Large Graphs via the Singular Value Decomposition
Machine Learning
Nonlinear programming: a historical view
ACM SIGMAP Bulletin
Document clustering with prior knowledge
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Intractability and clustering with constraints
Proceedings of the 24th international conference on Machine learning
A tutorial on spectral clustering
Statistics and Computing
Spectral clustering with inconsistent advice
Proceedings of the 25th international conference on Machine learning
Constrained Clustering: Advances in Algorithms, Theory, and Applications
Constrained Clustering: Advances in Algorithms, Theory, and Applications
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
FAC'11 Proceedings of the 6th international conference on Foundations of augmented cognition: directing the future of adaptive systems
Eigenvector sensitive feature selection for spectral clustering
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
Spectral clustering: A semi-supervised approach
Neurocomputing
Multi-modal constraint propagation for heterogeneous image clustering
MM '11 Proceedings of the 19th ACM international conference on Multimedia
Improving constrained clustering with active query selection
Pattern Recognition
Fast semi-supervised clustering with enhanced spectral embedding
Pattern Recognition
Active co-analysis of a set of shapes
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2012
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
LinkFCM: Relation integrated fuzzy c-means
Pattern Recognition
Improving document clustering using automated machine translation
Proceedings of the 21st ACM international conference on Information and knowledge management
Learning spectral embedding via iterative eigenvalue thresholding
Proceedings of the 21st ACM international conference on Information and knowledge management
Semi-supervised clustering via constrained symmetric non-negative matrix factorization
BI'12 Proceedings of the 2012 international conference on Brain Informatics
Clustering tagged documents with labeled and unlabeled documents
Information Processing and Management: an International Journal
Clustering documents with labeled and unlabeled documents using fuzzy semi-Kmeans
Fuzzy Sets and Systems
Constrained spectral embedding for K-way data clustering
Pattern Recognition Letters
Flexible and robust co-regularized multi-domain graph clustering
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Network discovery via constrained tensor analysis of fMRI data
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Probability-one homotopy maps for tracking constrained clustering solutions
Proceedings of the High Performance Computing Symposium
How to "alternatize" a clustering algorithm
Data Mining and Knowledge Discovery
Semi-supervised clustering via multi-level random walk
Pattern Recognition
On constrained spectral clustering and its applications
Data Mining and Knowledge Discovery
Constrained instance clustering in multi-instance multi-label learning
Pattern Recognition Letters
Adaptive evolutionary clustering
Data Mining and Knowledge Discovery
Hi-index | 0.00 |
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering remains a developing area. In this paper, we propose a flexible and generalized framework for constrained spectral clustering. In contrast to some previous efforts that implicitly encode Must-Link and Cannot-Link constraints by modifying the graph Laplacian or the resultant eigenspace, we present a more natural and principled formulation, which preserves the original graph Laplacian and explicitly encodes the constraints. Our method offers several practical advantages: it can encode the degree of belief (weight) in Must-Link and Cannot-Link constraints; it guarantees to lower-bound how well the given constraints are satisfied using a user-specified threshold; and it can be solved deterministically in polynomial time through generalized eigendecomposition. Furthermore, by inheriting the objective function from spectral clustering and explicitly encoding the constraints, much of the existing analysis of spectral clustering techniques is still valid. Consequently our work can be posed as a natural extension to unconstrained spectral clustering and be interpreted as finding the normalized min-cut of a labeled graph. We validate the effectiveness of our approach by empirical results on real-world data sets, with applications to constrained image segmentation and clustering benchmark data sets with both binary and degree-of-belief constraints.