Attribute-incremental construction of the canonical implication basis

DOI10.1007/s10472-007-9057-2zbMath1125.68121OpenAlexW2036999777WikidataQ62046337 ScholiaQ62046337MaRDI QIDQ2385433

Sergei Obiedkov, Vincent Duquenne

Publication date: 12 October 2007

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

Full work available at URL: https://doi.org/10.1007/s10472-007-9057-2

zbMATH Keywords

Galois latticeDuquenne-Guigues basisIncremental algorithmImplicationFormal concept analysis

Mathematics Subject Classification ID

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

Related Items (17)

Axiomatisation of general concept inclusions from finite interpretations ⋮ LinCbO: fast algorithm for computation of the Duquenne-Guigues basis ⋮ Pruning techniques in lincbo for the computation of the duquenne-guigues basis ⋮ Mining ℰℒ⊥ Bases with Adaptable Role Depth ⋮ Interactive error correction in implicative theories ⋮ On the complexity of enumerating pseudo-intents ⋮ Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements ⋮ Some Complexity Results about Essential Closed Sets ⋮ ON THE NON-REDUNDANT REPRESENTATION OF THE MINIMAX BASIS OF STRONG ASSOCIATIONS ⋮ Optimizations in computing the Duquenne-Guigues basis of implications ⋮ Fast algorithms for implication bases and attribute exploration using proper premises ⋮ A depth-first search algorithm for computing pseudo-closed sets ⋮ Using congruence relations to extract knowledge from concept lattices ⋮ Decision implication canonical basis: a logical perspective ⋮ Computing the Duquenne–Guigues basis: an algorithm for choosing the order ⋮ Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis ⋮ Approximate computation of exact association rules

Uses Software

• AddIntent
• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of finite closure spaces based on implications
• On the irredundant generation of knowledge spaces
• Minimal Representation of Directed Hypergraphs
• THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS
• Comparing performance of algorithms for generating concept lattices
• Concept Lattices

This page was built for publication: Attribute-incremental construction of the canonical implication basis