Recursive decomposition tree of a Moore co-family and closure algorithm.
From MaRDI portal
Publication:2248537
DOI10.1007/s10472-013-9362-xzbMath1311.06004OpenAlexW2039692741WikidataQ60691969 ScholiaQ60691969MaRDI QIDQ2248537
Alexis Irlande, Pierre Colomb, Yoan Renaud, Olivier Raynaud
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-9362-x
Structure theory of lattices (06B05) Galois correspondences, closure operators (in relation to ordered sets) (06A15)
Cites Work
- Recursive decomposition and bounds of the lattice of Moore co-families.
- Functional dependencies in relational databases: A lattice point of view
- Latticial structures in data analysis.
- The number of Moore families on \(n=6\)
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- On the number of databases and closure operations
- Rings of sets
- Counting of Moore Families for n=7
- Two Basic Algorithms in Concept Analysis
- The Diclique Representation and Decomposition of Binary Relations
- Knowledge Spaces
- Formal Concept Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item