Skip to Main content Skip to Navigation
Conference papers

Bicluster enumeration using Formal Concept Analysis

Victor Codocedo 1 Amedeo Napoli 1 
1 ORPAILLEUR - Knowledge representation, reasonning
Inria Nancy - Grand Est, LORIA - NLPKD - Department of Natural Language Processing & Knowledge Discovery
Abstract : In this work we introduce a novel technique to enumerate constant row/column value biclusters using formal concept analysis. To achieve this, a numerical data-table (standard input for biclustering al-gorithms) is modelled as a many-valued context where rows represent objects and columns represent attributes. Using equivalence relations de-fined for each single column, we are able to translate the bicluster mining problem in terms of the partition pattern structure framework. We show how biclustering can benefit from the FCA framework through its ro-bust theoretical description and efficient algorithms. Finally, we show how this technique is able to find high quality biclusters (in terms of the mean squared error) more efficiently than a state-of-the-art bicluster algorithm.
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Victor Codocedo Connect in order to contact the contributor
Submitted on : Tuesday, December 16, 2014 - 2:09:07 PM
Last modification on : Thursday, August 4, 2022 - 5:18:45 PM
Long-term archiving on: : Monday, March 23, 2015 - 2:02:10 PM


Files produced by the author(s)


  • HAL Id : hal-01095884, version 1


Victor Codocedo, Amedeo Napoli. Bicluster enumeration using Formal Concept Analysis. What formal concept analysis can do for artificial intelligence? (FCA4AI 2014) Workshop at ECAI 2014, Aug 2014, Prague, Czech Republic. ⟨hal-01095884⟩



Record views


Files downloads