Fast Gaussian Pairwise Constrained Spectral ...
Document type :
Autre communication scientifique (congrès sans actes - poster - séminaire...): Communication dans un congrès avec actes
Title :
Fast Gaussian Pairwise Constrained Spectral Clustering
Author(s) :
Chatel, David [Auteur correspondant]
Machine Learning in Information Networks [MAGNET]
Denis, Pascal [Auteur]
Machine Learning in Information Networks [MAGNET]
Tommasi, Marc [Auteur]
Machine Learning in Information Networks [MAGNET]
Machine Learning in Information Networks [MAGNET]
Denis, Pascal [Auteur]

Machine Learning in Information Networks [MAGNET]
Tommasi, Marc [Auteur]

Machine Learning in Information Networks [MAGNET]
Conference title :
ECML/PKDD - 7th European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases
City :
Nancy
Country :
France
Start date of the conference :
2014-09-15
Publication date :
2014
English keyword(s) :
Graphs
Semi-supervised clustering
Pairwise constraints
Semi-supervised clustering
Pairwise constraints
HAL domain(s) :
Informatique [cs]/Intelligence artificielle [cs.AI]
English abstract : [en]
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 ...
Show more >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.Show less >
Show more >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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.inria.fr/hal-01017269/document
- Open access
- Access the document
- http://hal.univ-lille3.fr/docs/01/01/72/69/PDF/fgpwc.pdf
- Open access
- Access the document
- https://hal.inria.fr/hal-01017269/document
- Open access
- Access the document
- http://hal.univ-lille3.fr/docs/01/01/72/69/PDF/fgpwc.pdf
- Open access
- Access the document
- document
- Open access
- Access the document
- fgpwc.pdf
- Open access
- Access the document
- document
- Open access
- Access the document
- fgpwc.pdf
- Open access
- Access the document