Partitioning hard clustering algorithms based on multiple dissimilarity matrices

Francisco de A.T. de Carvalho, Yves Lechevallier, Filipe M. de Melo
2012 Pattern Recognition  
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
more » ... ng 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. (Yves Lechevallier), (Filipe M. de Melo). 1 Acknowledgements. The authors are grateful to anonymous referees for their careful revision, valuable suggestion, and comments that have improved this paper. This research was partially supported by grants from CNPq, FACEPE (Brazilian Agencies) and from a conjoint research project FACEPE and INRIA (France).
doi:10.1016/j.patcog.2011.05.016 fatcat:fmrnc5eotzgwdepehqfqtsm7vu