Concept approximation in concept lattice
From MaRDI portal
Recommendations
Cited in
(24)- Rough-set concept analysis: interpreting RS-definable concepts based on ideas from formal concept analysis
- Dependence space models to construct concept lattices
- Object-oriented interval-set concept lattices
- Axiomatic characterizations of dual concept lattices
- Reduction method for concept lattices based on rough set theory and its application
- Approaches to knowledge reduction in generalized consistent decision formal context
- Set approximations in fuzzy formal concept analysis
- A non-distributive logic for semiconcepts and its modal extension with semantics based on Kripke contexts
- A comparative study of rough approximation of lattices
- On S-concept lattice theory
- Approximations in concept lattices
- A Comparison of Pawlak’s and Skowron–Stepaniuk’s Approximation of Concepts
- Concept recognition: An approximate reasoning framework
- Concept lattice for rough approximation
- Formal rough concept analysis
- Relations of reduction between covering generalized rough sets and concept lattices
- Lattice logic as a fragment of (2-sorted) residuated modal logic
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Generalizations of Approximable Concept Lattice
- AI*IA 2005: Advances in Artificial Intelligence
- A Generalized Concept Lattice
- Algebras from Semiconcepts in Rough Set Theory
- Kripke contexts, double Boolean algebras with operators and corresponding modal systems
This page was built for publication: Concept approximation in concept lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768563)