Multi-view clustering on relational data

7Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

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. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

De A.t. De Carvalho, F., Lechevallier, Y., Despeyroux, T., & De Melo, F. M. (2014). Multi-view clustering on relational data. Studies in Computational Intelligence, 527, 37–51. https://doi.org/10.1007/978-3-319-02999-3_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free