Handling high dimensionality contexts in formal concept analysis via binary decision diagrams
From MaRDI portal
Publication:781866
DOI10.1016/j.ins.2017.11.028zbMath1436.68338OpenAlexW2768296059MaRDI QIDQ781866
Mark A. J. Song, Luis E. Zárate, Sebastiao M. Neto
Publication date: 20 July 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2017.11.028
Related Items
Variable-precision three-way concepts in \textbf{L}-contexts ⋮ A comparative study of decision implication, concept rule and granular rule ⋮ Describing hierarchy of concept lattice by using matrix
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections
- A fast algorithm for building lattices
- On the irredundant generation of knowledge spaces
- Formal concept analysis. Foundations and applications.
- Two Basic Algorithms in Concept Analysis
- RESTRUCTURING LATTICE THEORY: AN APPROACH BASED ON HIERARCHIES OF CONCEPTS
- Graph-Based Algorithms for Boolean Function Manipulation
- Binary Decision Diagrams
- Comparing performance of algorithms for generating concept lattices
- On computing the size of a lattice and related decision problems