Mining Biclusters of Similar Values with Triadic Concept Analysis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Mining Biclusters of Similar Values with Triadic Concept Analysis


Biclustering numerical data became a popular data-mining task in the beginning of 2000's, especially for analysing gene expression data. A bicluster reflects a strong association between a subset of objects and a subset of attributes in a numerical object/attribute data-table. So called biclusters of similar values can be thought as maximal sub-tables with close values. Only few methods address a complete, correct and non redundant enumeration of such patterns, which is a well-known intractable problem, while no formal framework exists. In this paper, we introduce important links between biclustering and formal concept analysis. More specifically, we originally show that Triadic Concept Analysis (TCA), provides a nice mathematical framework for biclustering. Interestingly, existing algorithms of TCA, that usually apply on binary data, can be used (directly or with slight modifications) after a preprocessing step for extracting maximal biclusters of similar values.
Fichier principal
Vignette du fichier
CLA-11.pdf (394.65 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-00640873 , version 1 (14-11-2011)



Mehdi Kaytoue, Sergei O. Kuznetsov, Juraj Macko, Wagner Meira, Amedeo Napoli. Mining Biclusters of Similar Values with Triadic Concept Analysis. The Eighth International Conference on Concept Lattices and their Applications - CLA 2011, INRIA Nancy Grand Est - LORIA, Oct 2011, Nancy, France. ⟨hal-00640873⟩
256 View
233 Download



Gmail Facebook Twitter LinkedIn More