Multi-View Clustering on Relational Data - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2013

Multi-View Clustering on Relational Data


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.

Dates and versions

hal-00904524 , version 1 (14-11-2013)



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⟩


175 View
0 Download



Gmail Facebook X LinkedIn More