Topological approaches to covering rough sets
By William Zhu. Information Sciences, 2007
636 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Information Systems, Signal Processing
View Paper: https://www.semanticscholar.org/paper/acbe3b02b89de659d3b4a803a058aa2214de6b2b
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Feng Feng
- Xiaoyan Liu
- Violeta Leoreanu Fotea
- Young Bae Jun
- A. A. El-latif
- William Zhu
- Naim Çagman
- Serdar Enginoğlu
In Information Systems
In Signal Processing
Citations in the corpus
- δβ-I APPROXIMATION SPACES (2017, background): “However, (RST) has rapidly found a lot of applications in numerous fields [2, 4, 8, 17, 20, 24].”
- Soft sets and soft rough sets (2011, background): “The covering-based approximations of X1 are (X1)+ = ; and (X1) = {u1}, according to the definition in [37].”
- Relationship between generalized rough sets based on binary relation and covering (2009, background): “For the five types of covering-based rough sets defined in Definition 6, reducible element is an important concept for the above problems [50,52,53,58].”