Skip to Main content Skip to Navigation
Conference papers

Fast Gaussian Pairwise Constrained Spectral Clustering

David Chatel 1, * Pascal Denis 1 Marc Tommasi 1
* Corresponding author
1 MAGNET - Machine Learning in Information Networks
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : We consider the problem of spectral clustering with partial supervision in the form of must-link and cannot-link constraints. Such pairwise constraints are common in problems like coreference resolution in natural language processing. The approach developed in this paper is to learn a new representation space for the data together with a dis-tance in this new space. The representation space is obtained through a constraint-driven linear transformation of a spectral embedding of the data. Constraints are expressed with a Gaussian function that locally reweights the similarities in the projected space. A global, non-convex optimization objective is then derived and the model is learned via gradi-ent descent techniques. Our algorithm is evaluated on standard datasets and compared with state of the art algorithms, like [14,18,31]. Results on these datasets, as well on the CoNLL-2012 coreference resolution shared task dataset, show that our algorithm significantly outperforms related approaches and is also much more scalable.
Document type :
Conference papers
Complete list of metadata
Contributor : Team Magnet Connect in order to contact the contributor
Submitted on : Friday, July 18, 2014 - 3:35:43 PM
Last modification on : Thursday, January 20, 2022 - 5:29:08 PM
Long-term archiving on: : Thursday, November 20, 2014 - 4:42:24 PM


Files produced by the author(s)



David Chatel, Pascal Denis, Marc Tommasi. Fast Gaussian Pairwise Constrained Spectral Clustering. ECML/PKDD - 7th European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Sep 2014, Nancy, France. pp.242 - 257, ⟨10.1007/978-3-662-44848-9_16⟩. ⟨hal-01017269⟩



Les métriques sont temporairement indisponibles