Semi-supervised Learning with Penalized Probabilistic Clustering
Zhengdong Lu, Todd K. Leen · 2004
While clustering is usually an unsupervised operation, there are circumstances in which we believe (with varying degrees of certainty) that items A and B should be assigned to the same cluster, while items A and C should not. We would like such pairwise relations to influence cluster assignments of out-of-sample data in a manner consistent with the prior knowledge expressed in the training set. Our starting point is probabilistic clustering based on Gaussian mixture models (GMM) of the data distribution. We express clustering preferences in the prior distribution over assignments of data points to clusters. This prior penalizes cluster assignments according to the degree with which they violate the preferences. We fit the model parameters with EM. Experiments on a variety of data sets show that PPC can consistently improve clustering results. 1
Cited by 99 works.
Authors
References
- Maximum Likelihood from Incomplete Data Via the EM Algorithm
- Constrained K-means Clustering with Background Knowledge
- A multiscale random field model for Bayesian image segmentation
- Semi-supervised Clustering by Seeding
- From Instance-level Constraints to Space-Level Constraints: Making the Most of Prior Knowledge in Data Clustering
- Computing Gaussian Mixture Models with EM Using Equivalence Constraints