Towards fault-tolerant formal concept analysis

Abstract : Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very large data sets, have motivated new algorithms which can perform constraint-based mining of formal concepts (i.e., closed sets on both dimensions which are associated by the Galois connection and satisfy some user-defined constraints). In this paper, we consider a major limit of these approaches when considering noisy data sets. This is indeed the case of Boolean gene expression data analysis where objects denote biological experiments and attributes denote gene expression properties. In this type of intrinsically noisy data, the Galois association is so strong that the number of extracted formal concepts explodes. We formalize the computation of the so-called delta-bi-sets as an alternative for capturing strong associations between sets of objects and sets of properties. Based on a previous work on approximate condensed representations of frequent sets by means of delta-free itemsets, we get an efficient technique which can be applied on large data sets. An experimental validation on both synthetic and real data is given. It confirms the added-value of our approach w.r.t. formal concept discovery, i.e., the extraction of smaller collections of relevant associations.
Type de document :
Communication dans un congrès
9th Congress of the Italian Association for Artificial Intelligence, AI*IA'05, Sep 2005, Milano, Italy. Springer, pp.212-223, 2005, 〈10.1007/11558590_22〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01596133
Contributeur : Équipe Gestionnaire Des Publications Si Liris <>
Soumis le : mercredi 27 septembre 2017 - 11:52:49
Dernière modification le : jeudi 1 novembre 2018 - 01:21:07

Identifiants

Citation

Ruggero Pensa, Jean-François Boulicaut. Towards fault-tolerant formal concept analysis. 9th Congress of the Italian Association for Artificial Intelligence, AI*IA'05, Sep 2005, Milano, Italy. Springer, pp.212-223, 2005, 〈10.1007/11558590_22〉. 〈hal-01596133〉

Partager

Métriques

Consultations de la notice

97