The fixed-point semantics of relational concept analysis
From MaRDI portal
Cites work
- A Finite Basis for the Set of $\mathcal{EL}$ -Implications Holding in a Finite Model
- A lattice-theoretical fixpoint theorem and its applications
- Complex data analytics with formal concept analysis
- Concept Lattices of a Relational Structure
- Fixed-point semantics for barebone relational concept analysis
- Fixing generalization defects in \textsc{UML} use case diagrams
- Formal concept analysis. Foundations and applications.
- Graph-FCA: an extension of formal concept analysis to knowledge graphs
- scientific article; zbMATH DE number 1670907 (Why is no real title available?)
- scientific article; zbMATH DE number 1670908 (Why is no real title available?)
- scientific article; zbMATH DE number 1808289 (Why is no real title available?)
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 7635224 (Why is no real title available?)
- Link key candidate extraction with relational concept analysis
- Mining ℰℒ⊥ Bases with Adaptable Role Depth
- Reasoning and revision in hybrid representation systems
- Relational concept analysis: mining concept lattices from multi-relational data
- Relational concept discovery in structured datasets
- Soundness and completeness of relational concept analysis
- The Description Logic Handbook
This page was built for publication: The fixed-point semantics of relational concept analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912843)
