Computing the Duquenne-Guigues basis: an algorithm for choosing the order

DOI10.1080/03081079.2015.1072922MaRDI QIDQ2817077zbMATH OpenOpenAlexFDO

Authors Alexandre Bazin, Jean-Gabriel Ganascia

Publication date 29 August 2016

Published in International Journal of General Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081079.2015.1072922

zbMATH Keywords

Duquenne-Guigues basisformal concept analysispseudo-intents

Mathematics Subject Classification ID

Knowledge representation (68T30)

Recommendations

• A depth-first search algorithm for computing pseudo-closed sets
• Optimizations in computing the Duquenne-Guigues basis of implications
• Some Computational Problems Related to Pseudo-intents
• Some decision and counting problems of the Duquenne-Guigues basis of implications
• On the complexity of enumerating pseudo-intents

Cites work

• Attribute-incremental construction of the canonical implication basis
• Computing premises of a minimal cover of functional dependencies is intractable
• On the complexity of enumerating pseudo-intents
• On the Merge of Factor Canonical Bases
• Some decision and counting problems of the Duquenne-Guigues basis of implications
• Two basic algorithms in concept analysis

Cited in

(6)

• A depth-first search algorithm for computing pseudo-closed sets
• Steps towards causal Formal Concept Analysis
• Optimizations in computing the Duquenne-Guigues basis of implications
• LinCbO: fast algorithm for computation of the Duquenne-Guigues basis
• Pruning techniques in lincbo for the computation of the duquenne-guigues basis
• Extracting attribute implications from a formal context: unifying the basic approaches

This page was built for publication: Computing the Duquenne-Guigues basis: an algorithm for choosing the order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817077)