Abstract
There is an open question regarding Rough Set theory propsosed by Yun and Qiu(2011), which are how to characterize the conditions for a neighborhood of a data item approximations to form a partition of the universe U of the data by using only their upper and lower operators. The first part of the question has been solved Fan and Hu(2012). In this paper, another part of the question is addressed by a special and simple method, and some significant results are obtained.
Original language | English |
---|---|
Pages | 61-65 |
Number of pages | 5 |
DOIs | |
State | Published - 2013 |
Event | 2013 4th Global Congress on Intelligent Systems, GCIS 2013 - Hong Kong, China Duration: Dec 3 2013 → Dec 4 2013 |
Conference
Conference | 2013 4th Global Congress on Intelligent Systems, GCIS 2013 |
---|---|
Country/Territory | China |
City | Hong Kong |
Period | 12/3/13 → 12/4/13 |
Keywords
- Covering
- Lower approximation
- Neighborhhod
- Partition
- Upper approximation