Supervised clustering with structural svms
Thorsten Joachims, Thomas Finley · eCommons (Cornell University) · 2009
Supervised clustering is the problem of training clustering methods to produce desirable clusterings. Given sets of items and complete clusterings over these sets, a supervised clustering algorithm learns how to cluster future sets of items in a similar fashion, typically by changing the underlying similarity measure between item pairs. This work presents a general approach for training clustering methods such as correlation clustering and k-means/spectral clustering able to optimize to task-specific performance criteria using structural SVMs. We empirically and theoretically analyze our supervised clustering approach on a variety of datasets and clustering methods. This analysis also leads to general insights about structural SVMs beyond supervised clustering. Specifically, since clustering is a NP-hard task and the corresponding training problem likewise must make use of approximate inference during training of the parameters, we present a detailed theoretical and empirical analysis of the general use of approximations in structural SVM training.
Cited by 1 works. Open-access PDF
Authors
References
- Maximum Likelihood from Incomplete Data Via the EM Algorithm
- LIBSVM
- Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
- Normalized cuts and image segmentation
- Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
- Training Products of Experts by Minimizing Contrastive Divergence
- Pattern Recognition with Fuzzy Objective Function Algorithms
- Hierarchical Clustering Schemes
- A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics
- A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters