Semi-supervised clustering uses a small amount of supervised data to aid unsupervised learning. One typical approach specifies a limited number of must-link and cannot-link constraints between pairs of examples. This paper presents a pairwise constrained clustering framework and a new method for actively selecting informative pairwise constraints to get improved clustering performance. The clustering and active learning methods are both easily scalable to large datasets, and can handle very high dimensional data. Experimental and theoretical results confirm that this active querying of pairwise constraints significantly improves the accuracy of clustering when given a relatively small amount of supervision.

PDF, PS

In Proceedings of the 2004 SIAM International Conference on Data Mining (SDM-04), April 2004.

@InProceedings{basu:sdm04, title={Active Semi-Supervision for Pairwise Constrained Clustering}, author={Sugato Basu and Arindam Banerjee and Raymond J. Mooney}, booktitle={Proceedings of the 2004 SIAM International Conference on Data Mining (SDM-04)}, month={April}, url="http://www.cs.utexas.edu/users/ai-lab?basu:sdm04", year={2004} }