Clustering or bi-clustering techniques have been proved quite useful in many application domains. A weakness of these techniques remains the poor support for grouping characterization. We consider eventually large Boolean data sets which record properties of objects and we assume that a bi-partition is available. We introduce a generic cluster characterization technique which is based on collections of bi-sets (i.e., sets of objects associated to sets of properties) which satisfy some userdefined constraints, and a measure of the accuracy of a given bi-set as a bi-cluster characterization pattern. The method is illustrated on both formal concepts (i.e., "maximal rectangles of true values") and the new type of δ-bi-sets (i.e., "rectangles of true values with a bounded number of exceptions per column"). The added-value is illustrated on benchmark data and two real data sets which are intrinsically noisy: a medical data about meningitis and Plasmodium falciparum gene expression data. © Springer.Verlag Berlin Heidelberg 2005.
CITATION STYLE
Pensa, R. G., & Boulicaut, J. F. (2005). From local pattern mining to relevant bi-cluster characterization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3646 LNCS, pp. 293–304). Springer Verlag. https://doi.org/10.1007/11552253_27
Mendeley helps you to discover research relevant for your work.