Approximations in concept lattices
From MaRDI portal
Publication:3552283
DOI10.1007/978-3-642-11928-6_8zbMATH Open1274.06022OpenAlexW1540049221MaRDI QIDQ3552283FDOQ3552283
Authors: Christian Meschke 
Publication date: 14 April 2010
Published in: Formal Concept Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11928-6_8
Recommendations
Cited In (20)
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Power contexts and their concept lattices
- Title not available (Why is that?)
- Block relations in formal fuzzy concept analysis
- Lattices of Rough Set Abstractions as P-Products
- Algebras from Semiconcepts in Rough Set Theory
- Weak approximable concepts and completely algebraic lattices
- Triadic concept approximation
- Fuzzy and rough formal concept analysis: a survey
- On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction
- 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
- On homogeneousL-bonds and heterogeneousL-bonds
- A Comparison of Pawlak’s and Skowron–Stepaniuk’s Approximation of Concepts
- A comparative study of rough approximation of lattices
- Concept recognition: An approximate reasoning framework
- On Rough Concept Lattices
- Kripke contexts, double Boolean algebras with operators and corresponding modal systems
- Title not available (Why is that?)
- Merging ordered sets.
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)
