Skip to Main content Skip to Navigation
Book sections

Multi-View Clustering on Relational Data

Abstract : Clustering is a popular task in knowledge discovery. In this chapter we illustrate this fact with a new clustering algorithm that is able to partition objects taking into account simultaneously their relational descriptions given by multiple dissimilarity matrices. The advantages of this algorithm are threefold: it uses any dissimilarities between objects, it automatically ponderates the impact of each dissimilarity matrice and it provides interpretation tools. We illustrate the usefulness of this clustering method with two experiments. The first one uses a data set concerning handwritten numbers (digitized pictures) that must be recognized. The second uses a set of reports for which we have an expert classification given a priori so we can compare this classification with the one obtained automatically.
Document type :
Book sections
Complete list of metadata
Contributor : Thierry Despeyroux Connect in order to contact the contributor
Submitted on : Thursday, November 14, 2013 - 4:04:35 PM
Last modification on : Thursday, February 3, 2022 - 11:17:02 AM




Thierry Despeyroux, Francisco de A.T. de Carvahlo, Yves Lechevallier, Filipe M. de Melo. Multi-View Clustering on Relational Data. Fabrice Guillet and Bruno Pinaud and Gilles Venturini and Djamel Abdelkader Zighed. Advances in Knowledge Discovery and management, vol. 4, 527, Springer International Publishing, pp.37-51, 2013, Studies in Computational Intelligence, 978-3-319-02998-6 (Print) 978-3-319-02999-3 (Online). ⟨10.1007/978-3-319-02999-3⟩. ⟨hal-00904524⟩



Record views