Clustering is a very powerful tool for automatic detection of relevant sub-groups in unlabeled data sets. It can be sometime very interesting to be able to regroup and visualize the attributes used to describe the data, in addition to the clustering of these data. In this paper, we propose a coclustering algorithm based on the learning of a Self Organizing Map. The new algorithm will thus be able at the same time to map data and features in a low dimensional sub-space, allowing simple visualization, and to produce a clustering of both data and features. The resulting output is therefore very informative and easy to analyze. © 2011 Springer-Verlag.
CITATION STYLE
Cabanes, G., Bennani, Y., & Fresneau, D. (2011). A new simultaneous two-levels coclustering algorithm for behavioural data-mining. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7063 LNCS, pp. 745–752). https://doi.org/10.1007/978-3-642-24958-7_86
Mendeley helps you to discover research relevant for your work.