Abstract
Bi-clustering is a promising conceptual clustering approach. Within categorical data, it provides a collection of (possibly overlapping) bi-clusters, i.e., linked clusters for both objects and attribute-value pairs. We propose a generic framework for bi-clustering which enables to compute a bi-partition from collections of local patterns which capture locally strong associations between objects and properties. To validate this framework, we have studied in details the instance CDK-MEANS. It is a K-MEANS-like clustering on collections of formal concepts, i.e., connected closed sets on both dimensions. It enables to build bi-partitions with a user control on overlapping between bi-clusters. We provide an experimental validation on many benchmark datasets and discuss the interestingness of the computed bi-partitions. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Pensa, R. G., Robardet, C., & Boulicaut, J. F. (2005). A Bi-clustering framework for categorical data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3721 LNAI, pp. 643–650). https://doi.org/10.1007/11564126_68
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.