Supervised clustering with support vector machines
Thomas Finley, Thorsten Joachims · International Conference on Machine Learning · 2005
Supervised clustering is the problem of training a clustering algorithm to produce desirable clusterings: given sets of items and complete clusterings over these sets, we learn how to cluster future sets of items. Example applications include noun-phrase coreference clustering, and clustering news articles by whether they refer to the same topic. In this paper we present an SVM algorithm that trains a clustering algorithm by adapting the item-pair similarity measure. The algorithm may optimize a variety of different clustering functions to a variety of clustering performance measures. We empirically evaluate the algorithm for noun-phrase and news article clustering.
Cited by 212 works. doi:10.1145/1102351.1102379
Authors
References
- Objective Criteria for the Evaluation of Clustering Methods
- Max-Margin Markov Networks
- Support vector machine learning for interdependent and structured output spaces
- Constrained K-means Clustering with Background Knowledge
- A model-theoretic coreference scoring scheme
- Efficient clustering of high-dimensional data sets with application to reference matching
- A Machine Learning Approach to Coreference Resolution of Noun Phrases
- Improving machine learning approaches to coreference resolution
- A probabilistic framework for semi-supervised clustering
- Integrating constraints and metric learning in semi-supervised clustering