Nonlinear multicriteria clustering based on multiple dissimilarity matrices - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Pattern Recognition Année : 2013

Nonlinear multicriteria clustering based on multiple dissimilarity matrices

Résumé

We present a new algorithm capable of partitioning sets of objects by taking simultaneously into account their relational descriptions given by multiple dissimilarity matrices. The novelty of the algorithm is that it is based on a nonlinear aggregation criterion, weighted Tchebycheff distances, more appropriate than linear combinations (such as weighted averages) for the construction of compromise solutions. We obtain a hard partition of the set of objects, the prototype of each cluster and a weight vector that indicates the relevance of each matrix in each cluster. Since this is a clustering algorithm for relational data, it is compatible with any distance function used to measure the dissimilarity between objects. Results obtained in experiments with data sets (synthetic and real) show the usefulness of the proposed algorithm.
Fichier non déposé

Dates et versions

hal-00917496 , version 1 (11-12-2013)

Identifiants

  • HAL Id : hal-00917496 , version 1

Citer

Sergio Queiroz, Francisco de A.T. de Carvalho, Yves Lechevallier. Nonlinear multicriteria clustering based on multiple dissimilarity matrices. Pattern Recognition, 2013, 46 (12), pp.3383-3394. ⟨hal-00917496⟩

Collections

INRIA INRIA2
127 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More