Optimizations in computing the Duquenne-Guigues basis of implications

DOI10.1007/S10472-013-9353-YMaRDI QIDQ2248528zbMATH OpenOpenAlexWikidataFDO

Authors Konstantin Bazhanov, Sergei Obiedkov

Publication date 26 June 2014

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10472-013-9353-y

zbMATH Keywords

algorithmsDuquenne-Guigues basisformal concept analysisHorn formulaeimplicationsLinClosure

Mathematics Subject Classification ID

Galois correspondences, closure operators (in relation to ordered sets) (06A15) Knowledge representation (68T30) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• A depth-first search algorithm for computing pseudo-closed sets
• Computing the Duquenne-Guigues basis: an algorithm for choosing the order
• Formal Concept Analysis
• Some decision and counting problems of the Duquenne-Guigues basis of implications
• Direct-optimal basis computation by means of the fusion of simplification rules

Cites work

• Approaches to the selection of relevant concepts in the case of noisy data
• Attribute exploration with background knowledge
• Attribute-incremental construction of the canonical implication basis
• Comparing performance of algorithms for generating concept lattices
• Construction and learnability of canonical Horn formulas
• Horn approximations of empirical data
• scientific article; zbMATH DE number 3823168 (Why is no real title available?)
• scientific article; zbMATH DE number 108405 (Why is no real title available?)
• scientific article; zbMATH DE number 3464827 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 861622 (Why is no real title available?)
• scientific article; zbMATH DE number 7635224 (Why is no real title available?)
• Learning conjunctions of Horn clauses
• ON SUCCINCT REPRESENTATION OF KNOWLEDGE COMMUNITY TAXONOMIES WITH FORMAL CONCEPT ANALYSIS
• On the complexity of enumerating pseudo-intents
• On the Merge of Factor Canonical Bases
• Queries and concept learning
• Some decision and counting problems of the Duquenne-Guigues basis of implications
• THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS
• The multiple facets of the canonical direct unit implicational basis
• Two basic algorithms in concept analysis

Cited in

(15)

• On sets of graded attribute implications with witnessed non-redundancy
• A depth-first search algorithm for computing pseudo-closed sets
• Direct-optimal basis computation by means of the fusion of simplification rules
• Steps towards causal Formal Concept Analysis
• Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis
• Approximate computation of exact association rules
• On implication bases in \(n\)-lattices
• Computing the Duquenne-Guigues basis: an algorithm for choosing the order
• A comprehensive survey on formal concept analysis, its research trends and applications
• Formal Concept Analysis
• LinCbO: fast algorithm for computation of the Duquenne-Guigues basis
• Pruning techniques in lincbo for the computation of the duquenne-guigues basis
• Three views on dependency covers from an FCA perspective
• Formal concept analysis for the generation of plural referring expressions
• A minimal base or a direct base? That is the question!

Describes a project that uses

Uses Software

• UCI
• Boost C++ Libraries
• Boost
• Concept Explorer

This page was built for publication: Optimizations in computing the Duquenne-Guigues basis of implications

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