Skip to Main content Skip to Navigation
Journal articles

Relational partitioning fuzzy clustering algorithms based on multiple dissimilarity matrices

Abstract : This paper introduces fuzzy clustering algorithms that can partition objects taking into account simultaneously their relational descriptions given by multiple dissimilarity matrices. The aim is to obtain a collaborative role of the different dissimilarity matrices to get a final consensus partition. These matrices can be obtained using different sets of variables and dissimilarity functions. These algorithms are designed to furnish a partition and a prototype for each fuzzy cluster as well as to learn a relevance weight for each dissimilarity matrix by optimizing an adequacy criterion that measures the fit between the fuzzy clusters and their representatives. These relevance weights change at each algorithm iteration and can either be the same for all fuzzy clusters or different from one fuzzy cluster to another. Experiments with real-valued data sets from the UCI Machine Learning Repository as well as with interval-valued and histogram-valued data sets show the usefulness of the proposed fuzzy clustering algorithms.
Document type :
Journal articles
Complete list of metadata
Contributor : Yves Lechevallier Connect in order to contact the contributor
Submitted on : Wednesday, December 11, 2013 - 10:00:57 PM
Last modification on : Thursday, February 3, 2022 - 11:14:30 AM


  • HAL Id : hal-00917494, version 1



Yves Lechevallier, Francisco de Carvalho, Filipe de Melo. Relational partitioning fuzzy clustering algorithms based on multiple dissimilarity matrices. Fuzzy Sets and Systems, Elsevier, 2013, 215, pp.1-28. ⟨hal-00917494⟩



Record views