Generalizations of Approximable Concept Lattice
From MaRDI portal
Recommendations
Cited in
(9)- A note on variable threshold concept lattices: threshold-based operators are reducible to classical concept-forming operators
- Weak approximable concepts and completely algebraic lattices
- A Comparison of Pawlak’s and Skowron–Stepaniuk’s Approximation of Concepts
- scientific article; zbMATH DE number 6174032 (Why is no real title available?)
- Upper Bound for the Number of Concepts of Contranominal-Scale Free Contexts
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- A categorical view at generalized concept lattices
- A Generalized Concept Lattice
- Concept Lattices
This page was built for publication: Generalizations of Approximable Concept Lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452417)