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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bacelar-Nicolau, H.: The affinity coefficient. In: Bock, H.H., Diday, E. (eds.) Analysis of Symbolic Data, pp. 160–165. Springer, Heidelberg (2000)
Bock, H., Diday, E.: Analysis of Symbolic Data. Springer, Heidelberg (2000)
Breiman, L., Friedman, J., Stone, C.J., Olshen, R.A.: Classification and Regression Trees. Chapman and Hall/CRC, Boca Raton (1984)
Charrad, M., Lechevallier, Y., Ahmed, M.B., Saporta, G.: On the number of clusters in block clustering algorithms. In: Guesgen, H.W., Murray, R.C. (eds.) FLAIRS Conference. AAAI Press (2010)
Chavent, M.: Normalized k-means clustering of hyper-rectangles. In: Proceedings of the XIth International Symposium of Applied Stochastic Models and Data Analysis (ASMDA 2005), Brest, France, pp. 670–677 (2005)
Chavent, M., De Carvalho, F.A.T., Lechevallier, Y., Verde, R.: New clustering methods for interval data. Computational Statistics 21(2), 211–229 (2006)
Cleuziou, G., Exbrayat, M., Martin, L., Sublemontier, J.-H.: Cofkm: A centralized method for multiple-view clustering. In: ICDM 2009 Ninth IEEE International Conference on Data Mining, Miami, USA, pp. 752–757 (2009)
Da Silva, A.: Analyse de données évolutives: application aux données d’usage Web. PhD thesis, Université Paris-IX Dauphine (2009)
De Carvalho, F.A.T., Csernel, M., Lechevallier, Y.: Clustering constrained symbolic data. Pattern Recognition Letters 30(11), 1037–1045 (2009)
De Carvalho, F.A.T., Lechevallier, Y.: Partitional clustering algorithms for symbolic interval data based on single adaptive distances. Pattern Recognition 42(7), 1223–1236 (2009)
De Carvalho, F.A.T., Lechevallier, Y., De Melo, F.M.: Partitioning hard clustering algorithms based on multiple dissimilarity matrices. Pattern Recognition 45(1), 447–464 (2012)
De Carvalho, F.A.T., Lechevallier, Y., Verde, R.: Clustering methods in symbolic data analysis. In: Diday, E., Noirhomme-Fraiture, M. (eds.) Symbolic Data Analysis and the SODAS Software, pp. 181–204. Wiley-Interscience, San Francisco (2008)
De Carvalho, F.A.T., Despeyroux, T., De Melo, F.M., Lechevallier, Y.: Utilisation de matrices de dissimilarit multiples pour la classification de documents. In: EGC-M 2010, Extraction et Gestion des Connaissances, Alger, Algérie, pp. 1–10 (2010)
Diday, E., Govaert, G.: Classification automatique avec distances adaptatives. R.A.I.R.O. Informatique Computer Science 11(4), 329–349 (1977)
Frigui, H., Hwang, C., Rhee, F.C.: Clustering and aggregation of relational data with applications to image database categorization. Pattern Recognition 40(11), 3053–3068 (2007)
Gordon, A.: Classification. Chapman and Hall/CRC, Boca Raton, Florida (1999)
Hathaway, R.J., Davenport, J.W., Bezdek, J.C.: Relational duals of the c-means algorithms. Pattern Recognition 22, 205–212 (1989)
Hubert, L., Arabie, P.: Comparing partitions. Journal of Classification 2(1), 193–218 (1985)
Jain, A., Murty, M., Flyn, P.: Data clustering: A review. ACM Comput. Surv. 31(3), 264–323 (1999)
Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data. Wiley, New York (1990)
Lechevallier, Y.: Optimisation de quelques critères en classification automatique et application a l’étude des modifications des protéines sériques en pathologie clinique. PhD thesis, Université Paris-VI (1974)
Leclerc, B., Cucumel, G.: Concensus en classification: une revue bibliographique. Mathématique et Sciences Humaines 100, 109–128 (1987)
Milligan, G.W., Cooper, M.C.: An examination of procedures for determining the number of clusters in a data set. Psychometrika 50, 159–179 (1985)
Pedrycz, W.: Collaborative fuzzy clustering. Pattern Recognition Lett. 23, 675–686 (2002)
van Rijisbergen, C.J.: Information retrieval. Butterworth-Heinemann, London (1976)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
de A.T. de Carvalho, F., Lechevallier, Y., Despeyroux, T., de Melo, F.M. (2014). Multi-view Clustering on Relational Data. In: Guillet, F., Pinaud, B., Venturini, G., Zighed, D. (eds) Advances in Knowledge Discovery and Management. Studies in Computational Intelligence, vol 527. Springer, Cham. https://doi.org/10.1007/978-3-319-02999-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-02999-3_3
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-02998-6
Online ISBN: 978-3-319-02999-3
eBook Packages: EngineeringEngineering (R0)