Conjunctive query pattern structures: a relational database model for formal concept analysis
From MaRDI portal
Publication:2286397
DOI10.1016/j.dam.2019.08.019zbMath1430.68083OpenAlexW2972882262MaRDI QIDQ2286397
Publication date: 22 January 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.08.019
Related Items (2)
Orbital concept lattices ⋮ Relational concept analysis in practice: capitalizing on data modeling using design patterns
Cites Work
- Graph-based knowledge representation. Computational foundations of conceptual graphs
- Lattice model of browsable data spaces
- Relational concept discovery in structured datasets
- An Introduction to Description Logic
- Homomorphism preservation theorems
- Two Basic Algorithms in Concept Analysis
- A Proposal for Extending Formal Concept Analysis to Knowledge Graphs
- Concept Lattices of a Relational Structure
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Conjunctive query pattern structures: a relational database model for formal concept analysis