Towards a Constrained Clustering Algorithm Selection - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Towards a Constrained Clustering Algorithm Selection

Guilherme Alves
Miguel Couceiro
Amedeo Napoli

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.
Fichier principal
Vignette du fichier
_SFC_2019__Towards_a_Constrained_Clustering_Algorithm.pdf (274.85 Ko) Télécharger le fichier
Loading...

Dates and versions

hal-02397436 , version 1 (06-12-2019)

Identifiers

  • HAL Id : hal-02397436 , version 1

Cite

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⟩
124 View
263 Download

Share

Gmail Facebook X LinkedIn More