Approximations in concept lattices
From MaRDI portal
Publication:3552283
Recommendations
Cited in
(20)- On Rough Concept Lattices
- Merging ordered sets.
- Concept recognition: An approximate reasoning framework
- Algebras from Semiconcepts in Rough Set Theory
- Weak approximable concepts and completely algebraic lattices
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Triadic concept approximation
- Block relations in formal fuzzy concept analysis
- On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction
- Kripke contexts, double Boolean algebras with operators and corresponding modal systems
- scientific article; zbMATH DE number 1699994 (Why is no real title available?)
- scientific article; zbMATH DE number 5080679 (Why is no real title available?)
- A Comparison of Pawlak’s and Skowron–Stepaniuk’s Approximation of Concepts
- Power contexts and their concept lattices
- Fuzzy and rough formal concept analysis: a survey
- Lattices of Rough Set Abstractions as P-Products
- Comparing performance of algorithms for generating concept lattices
- An analysis of pitch-class segmentation in John Cage's \textit{Ryoanji for oboe} using morphological image analysis and formal concept analysis
- A comparative study of rough approximation of lattices
- On homogeneousL-bonds and heterogeneousL-bonds
This page was built for publication: Approximations in concept lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3552283)
