Discovery of the \(D\)-basis in binary tables based on hypergraph dualization
From MaRDI portal
Publication:507518
DOI10.1016/j.tcs.2015.11.031zbMath1356.68054arXiv1504.02875OpenAlexW1749537502MaRDI QIDQ507518
J. B. Nation, K. V. Adaricheva
Publication date: 6 February 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.02875
Database theory (68P15) Hypergraphs (05C65) Logic in artificial intelligence (68T27) Information storage and retrieval of data (68P20) Computational methods for problems pertaining to biology (92-08) Galois correspondences, closure operators (in relation to ordered sets) (06A15)
Related Items (6)
Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements ⋮ The joy of implications, aka pure Horn formulas: mainly a survey ⋮ Algorithms for \(k\)-meet-semidistributive lattices ⋮ Translating between the representations of a ranked convex geometry ⋮ Using congruence relations to extract knowledge from concept lattices ⋮ Measuring the Implications of the D-Basis in Analysis of Data in Biomedical Studies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of enumerating pseudo-intents
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- The multiple facets of the canonical direct unit implicational basis
- Attribute exploration with background knowledge
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- Ordered direct implicational basis of a finite closure system
- Computing premises of a minimal cover of functional dependencies is intractable
- Fast algorithms for implication bases and attribute exploration using proper premises
- Efficient algorithms for dualizing large-scale hypergraphs
- A framework for incremental generation of closed itemsets
- An approach to lattice varieties of finite height
- Constructing a Knowledge Base for Gene Regulatory Dynamics by Formal Concept Analysis Methods
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- Generating dual-bounded hypergraphs
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Dual subimplicants of positive Boolean functions
- Measuring the Implications of the D-Basis in Analysis of Data in Biomedical Studies
- Data mining. Concepts and techniques
This page was built for publication: Discovery of the \(D\)-basis in binary tables based on hypergraph dualization
