Set-theoretic approaches to granular computing
From MaRDI portal
Recommendations
Cited in
(25)- Binary classification of multigranulation searching algorithm based on probabilistic decision
- Towards a computation system based on set theory
- New perspectives of granular computing in relation geometry induced by pairings
- Comparative approaches to granularity in general rough sets
- Decision reducts and bireducts in a covering approximation space and their relationship to set definability
- Set-based granular computing: a lattice model
- Characterizing hierarchies on covering-based multigranulation spaces
- A semantically sound approach to Pawlak rough sets and covering-based rough sets
- Algebraic methods for granular rough sets
- Granular structures induced by interval sets and rough sets
- Approximation Theories: Granular Computing vs Rough Sets
- Granular Structures and Approximations in Rough Sets and Knowledge Spaces
- scientific article; zbMATH DE number 512377 (Why is no real title available?)
- Graded Set-Membership Models
- scientific article; zbMATH DE number 1931870 (Why is no real title available?)
- Granular computing: topological and categorical aspects of near and rough set approaches to granulation of knowledge
- Fractal analysis approaches to granular computing
- A Semantical Approach to Rough Sets and Dominance-Based Rough Sets
- A comparative analysis of granular computing clustering from the view of set
- scientific article; zbMATH DE number 2209358 (Why is no real title available?)
- A Roadmap from Rough Set Theory to Granular Computing
- Topological Aspects of Granular Computing
- Skill assessment method: a perspective from concept-cognitive learning
- Hierarchical description of uncertain information
- Interaction-based complexity measures in a progressive partition model of granular computing
This page was built for publication: Set-theoretic approaches to granular computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166681)
