Skip to Main content Skip to Navigation
Conference papers

Mining Biclusters of Similar Values with Triadic Concept Analysis

Abstract : 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.
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-00640873
Contributor : Mehdi Kaytoue Connect in order to contact the contributor
Submitted on : Monday, November 14, 2011 - 1:41:22 PM
Last modification on : Saturday, June 25, 2022 - 7:45:44 PM
Long-term archiving on: : Friday, November 16, 2012 - 10:51:26 AM

Files

CLA-11.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00640873, version 1
  • ARXIV : 1111.3270

Collections

Citation

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⟩

Share

Metrics

Record views

252

Files downloads

231