Skip to Main content Skip to Navigation
Conference papers

Towards a Constrained Clustering Algorithm Selection

Guilherme Alves 1 Miguel Couceiro 1 Amedeo Napoli 1
1 ORPAILLEUR - Knowledge representation, reasonning
Inria Nancy - Grand Est, LORIA - NLPKD - Department of Natural Language Processing & Knowledge Discovery
Abstract : The success of machine learning approaches to solving real-world problems motivated the plethora of new algorithms. However, it raises the issue of algorithm selection, as there is no algorithm that performs better than all others. Approaches for predicting which algorithms provide the best results for a given problem become useful, especially in the context of building workflows with several algorithms. Domain knowledge (in the form of constraints, preferences) should also be considered and used to guide the process and improve results. In this work, we propose a meta-learning approach that characterizes sets of constraints to decide which constrained clustering algorithm should be employed. We present an empirical study over real datasets using three clustering algorithms (one unsupervised and two semi-supervised), which shows improvements in cluster quality when compared to existing semi-supervised methodolo-gies.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download
Contributor : Guilherme Alves <>
Submitted on : Friday, December 6, 2019 - 4:14:41 PM
Last modification on : Tuesday, March 3, 2020 - 3:46:49 PM
Document(s) archivé(s) le : Saturday, March 7, 2020 - 6:49:10 PM


  • HAL Id : hal-02397436, version 1



Guilherme Alves, Miguel Couceiro, Amedeo Napoli. Towards a Constrained Clustering Algorithm Selection. 26èmes Rencontres de la Société Francophone de Classification, SFC 2019 - XXVIe Rencontres de la Société Francophone de Classification, Sep 2019, Nancy, France. ⟨hal-02397436⟩



Record views


Files downloads