Biclustering meets triadic concept analysis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Annals of Mathematics and Artificial Intelligence Year : 2014

Biclustering meets triadic concept analysis


Biclustering numerical data became a popular data-mining task at the be-ginning of 2000's, especially for gene expression data analysis and recommender sys-tems. 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, a well-known intractable problem, while no formal framework exists. We introduce impor-tant links between biclustering and Formal Concept Analysis (FCA). Indeed, FCA is known to be, among others, a methodology for biclustering binary data. Handling numerical data is not direct, and we argue that Triadic Concept Analysis (TCA), the extension of FCA to ternary relations, provides a powerful mathematical and algorithmic framework for biclustering numerical data. We discuss hence both theo-retical and computational aspects on biclustering numerical data with triadic concept analysis. These results also scale to n-dimensional numerical datasets.
Fichier principal
Vignette du fichier
mk-etal-amai70-2014.pdf (895.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01101143 , version 1 (09-01-2015)



Mehdi Kaytoue, Sergei O. Kuznetsov, Juraj Macko, Amedeo Napoli. Biclustering meets triadic concept analysis. Annals of Mathematics and Artificial Intelligence, 2014, 70, pp.55 - 79. ⟨10.1007/s10472-013-9379-1⟩. ⟨hal-01101143⟩
419 View
378 Download



Gmail Facebook X LinkedIn More