Preference-based clustering of large datasets - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Preference-based clustering of large datasets

Résumé

Clustering has been widely studied in Data Mining literature, where, through different measures related to similarity among objects, potential structures that exist in the data are uncovered. In the field of Multiple Criteria Decision Analysis (MCDA), this topic has received less attention, although the objects in this case, called alternatives, relate to each other through measures of preference, which give the possibility of structuring them in more diverse ways. In this paper we present an approach for clustering sets of alternatives using preferential information from a decision-maker. As clustering is dependent on the relations between the alternatives, clustering large datasets quickly becomes impractical, an issue we try to address by extending our approach accordingly.
Fichier non déposé

Dates et versions

hal-00800913 , version 1 (14-03-2013)

Identifiants

  • HAL Id : hal-00800913 , version 1

Citer

Alexandru Liviu Olteanu, Raymond Bisdorff, Patrick Meyer. Preference-based clustering of large datasets. DA2PL 2012: From multiple criteria Decision Aid to Preference Learning, Nov 2012, Mons, Belgium. pp.14 - 20. ⟨hal-00800913⟩
57 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More