Fast algorithms for implication bases and attribute exploration using proper premises

DOI10.1007/s10472-013-9355-9zbMath1314.68305OpenAlexW1980045446MaRDI QIDQ2248531

Felix Distel, Daniel Borchmann, Uwe Ryssel

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-9355-9

zbMATH Keywords

formal concept analysisproper premises

Mathematics Subject Classification ID

Knowledge representation (68T30) Logical aspects of lattices and related structures (03G10)

Related Items

Lattices, closures systems and implication bases: a survey of structural aspects and algorithms ⋮ Compressed representation of learning spaces ⋮ The joy of implications, aka pure Horn formulas: mainly a survey ⋮ Discovery of the \(D\)-basis in binary tables based on hypergraph dualization ⋮ Algorithms for \(k\)-meet-semidistributive lattices ⋮ On implication bases in \(n\)-lattices ⋮ Direct-optimal basis computation by means of the fusion of simplification rules ⋮ A methodology for analysis of concept lattice reduction ⋮ Steps towards causal Formal Concept Analysis ⋮ Measuring the Implications of the D-Basis in Analysis of Data in Biomedical Studies

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of enumerating pseudo-intents
• The multiple facets of the canonical direct unit implicational basis
• Attribute-incremental construction of the canonical implication basis
• An Efficient Algorithm for the Transversal Hypergraph Generation
• Attribute Exploration Using Implications with Proper Premises
• On Berge Multiplication for Monotone Boolean Dualization
• A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph
• Hardness of Enumerating Pseudo-intents in the Lectic Order
• Two Basic Algorithms in Concept Analysis
• Some Notes on Pseudo-closed Sets
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Algorithms for inferring functional dependencies from relations
• New Results on Monotone Dualization and Generating Hypergraph Transversals
• Towards an Error-Tolerant Construction of $\mathcal{EL}^\bot$ -Ontologies from Data Using Formal Concept Analysis

This page was built for publication: Fast algorithms for implication bases and attribute exploration using proper premises