data to aid unsupervised learning. One typical approach
specifies a limited number of must-link and cannotlink
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. ER - TY - CONF AU - Bilenko, Mikhail AU - Basu, Sugato AU - Mooney, Raymond J. A2 - T1 - Integrating constraints and metric learning in semi-supervised clustering. T2 - ICML PB - C1 - PY - 2004/ CY - VL - IS - SP - EP - UR - http://www.cs.utexas.edu/users/ml/papers/semi-icml-04.pdf DO - KW - clustering KW - constraints KW - metric L1 - SN - N1 - N1 - AB - ER -