A granular reduction algorithm based on covering rough sets
From MaRDI portal
Publication:1760906
DOI10.1155/2012/970576zbMath1251.68251WikidataQ58907024 ScholiaQ58907024MaRDI QIDQ1760906
Zhaowen Li, Xiaoqing Yang, Tian Yang
Publication date: 15 November 2012
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/970576
03E72: Theory of fuzzy sets, etc.
68T37: Reasoning under uncertainty in the context of artificial intelligence
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Cites Work
- Topological approaches to covering rough sets
- Approximations and reducts with covering generalized rough sets
- Reduction about approximation spaces of covering generalized rough sets
- Relationship between generalized rough sets based on binary relation and covering
- Rough sets in knowledge discovery 1. Methodology and applications
- Extensions and intensions in the rough set theory
- Constructive and algebraic methods of the theory of rough sets
- Rough sets and current trends in computing. 1st international conference, RSCTC '98, Warsaw, Poland, June 22--26, 1998. Proceedings
- Reduction and axiomization of covering generalized rough sets.
- Relational interpretations of neighborhood operators and rough set approximation operators
- Generalized fuzzy rough approximation operators based on fuzzy coverings
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- Construction of rough approximations in fuzzy setting
- Rough fuzzy approximations on two universes of discourse
- A systematic study on attribute reduction with rough sets based on general binary relations
- Rough approximations on a complete completely distributive lattice with applications to generalized rough sets
- Related family: a new method for attribute reduction of covering information systems
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
