Abstract
In this paper a crossed clustering algorithm is proposed to partitioning a set of symbolic objects in a fixed number of classes. This algorithm allows, at the same time, to determine a structure (taxonomy) on the categories of the object descriptors. This procedure is an extension of the classical simultaneous clustering algorithms, proposed on binary and contingency tables. It is based on a dynamical clustering algorithm on symbolic objects. The optimized criterion is the Φ2 distance computed between the objects description, given by modal variables (distributions) and the prototypes of the classes, described by marginal profiles of the objects set partitions. The convergence of the algorithm is guaranteed at a stationary value of the criterion, in correspondence of the best partition of the symbolic objects in r classes and the best partition of the symbolic descriptors in c groups. An application on web log data has allowed to validate the procedure and suggest it as an useful tool in the Web Usage Mining context.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
CELEUX, G., DIDAY, E., GOVAERT, G., LECHEVALLIER, Y., RALAM-BONDRAINY, H. (1989): Classification Automatique des Données, Environnement statistique et informatique, Bordas, Paris.
CHAVENT, M., DE CARVALHO, F.A.T., LECHEVALLIER, Y., VERDE, R. (2003): Trois nouvelles méthodes de classification automatique de données symboliques de type intervalle. Revue de Statistique Appliquées, n. 4.
DE CARVALHO, F.A.T, VERDE, R., LECHEVALLIER, Y. (2001): Deux nouvelles méthodes de classification automatique d'ensembles d'objets symboliques décrits par des variables intervalles. SFC'2001, Guadeloupe.
DIDAY, E. (1971): La méthode des Nuées dynamiques Revue de Statistique Appliquée, 19,2, 19–34.
GOVAERT, G. (1977): Algorithme de classification d'un tableau de contingence. In Proc. of first international symposium on Data Analysis and Informatics, INRIA, Versailles, 487–500.
GOVAERT, G. (1995): Simultaneous clustering of rows and columns. Control Cybernet., 24, 437–458
GOVAERT, G., NADIF M. (2003): Clustering with block mixture models. Pattern Recognition, Elservier Science Publishers, 36, 463–473
LECHEVALLIER, Y., TROUSSE, B., VERDE, R., TANASA, D. (2003): Classification automatique: Applications au Web-Mining. In: Proceeding of SFC2003, Neuchatel, 10–12 September.
SAUBERLICH, F, HUBER K.-P. (2001): A Framework for Web Usage Mining on Anonymous Logfile Data. In: Schwaiger M. and Opitz O. (Eds.): Exploratory Data Analysis in Empirical Research, Springer-Verlag, Heidelberg, 309–318.
VERDE, R., DE CARVALHO, F.A.T, LECHEVALLIER, Y. (2000): A Dynamical Clustering Algorithm for Multi-Nominal Data. In: H.A.L. Kiers, J.-P. Rasson, P.J.F. Groenen and M. Schader (Eds.): Data Analysis, Classification, and Related Methods, Springer-Verlag, Heidelberg, 387–394.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Verde, R., Lechevallier, Y. (2005). Crossed Clustering Method on Symbolic Data Tables. In: Bock, HH., et al. New Developments in Classification and Data Analysis. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27373-5_11
Download citation
DOI: https://doi.org/10.1007/3-540-27373-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23809-6
Online ISBN: 978-3-540-27373-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)