Constrained K-means Clustering with Background Knowledge
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Clustering with Instance-level Constraints
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Graph Partition by Swendsen-Wang Cuts
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
A probabilistic framework for semi-supervised clustering
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Learning with Constrained and Unlabelled Data
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Semi-supervised graph clustering: a kernel approach
ICML '05 Proceedings of the 22nd international conference on Machine learning
Proceedings of the 25th international conference on Machine learning
Using hidden Markov random fields to combine distributional and pattern-based word clustering
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
Semi-supervised clustering with metric learning: An adaptive kernel method
Pattern Recognition
Automatic handling of digital image repositories: a brief survey
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
An experimental study of constrained clustering effectiveness in presence of erroneous constraints
Information Processing and Management: an International Journal
A study of K-Means-based algorithms for constrained clustering
Intelligent Data Analysis
Hi-index | 0.00 |
We revisit recently proposed algorithms for probabilistic clustering with pair-wise constraints between data points. We evaluate and compare existing techniques in terms of robustness to misspecified constraints. We show that the technique that strictly enforces the given constraints, namely the chunklet model, produces poor results even under a small number of misspecified constraints. We further show that methods that penalize constraint violation are more robust to misspecified constraints but have undesirable local behaviors. Based on this evaluation, we propose a new learning technique, extending the chunklet model to allow soft constraints represented by an intuitive measure of confidence in the constraint.