Partitioning hard clustering algorithms based on multiple dissimilarity matrices

This paper introduces hard clustering algorithms that are able to partition objects taking into account simultaneously their relational descriptions given by multiple dissimilarity matrices. These matrices have been generated using different sets of variables and dissimilarity functions. These methods are designed to furnish a partition and a prototype for each cluster as well as to learn a relevance weight for each dissimilarity matrix by optimizing an adequacy criterion that measures the fitting between the clusters and their representatives. These relevance weights change at each algorithm iteration and can either be the same for all clusters or different from one cluster to another. Experiments with data sets (synthetic and from UCI machine learning repository) described by real-valued variables as well as with time trajectory data sets show the usefulness of the proposed algorithms.

► The clustering algorithms manage simultaneously multiple dissimilarity matrices. ► The algorithms give automatically a relevance weight for each dissimilarity matrix. ► Applications on synthetic and real-world data corroborate the proposed algorithms.