Abstract
We establish a characterization of upper approximation for binary relations. Based on this characterization, the R-definability of Slowinski and Vanderpooten is alternatively defined in terms of lower and upper approximations. In addition, some necessary conditions for R-definability are presented.
Original language | English |
---|---|
Title of host publication | Proceedings of 2016 IEEE International Conference on Cloud Computing and Big Data Analysis (ICCCBDA 2016) |
Editors | Qing Tan, En-Bing Lin, Tianrui Li |
Place of Publication | NY USA |
Publisher | IEEE, Institute of Electrical and Electronics Engineers |
Pages | 233-236 |
Number of pages | 4 |
ISBN (Electronic) | 9781509025947 |
ISBN (Print) | 9781509025954 |
DOIs | |
Publication status | Published - 2016 |
Event | IEEE International Conference on Cloud Computing and Big Data Analysis 2016 - Southwest Jiaotong University, Chengdu, China Duration: 5 Jul 2016 → 7 Jul 2016 |
Conference
Conference | IEEE International Conference on Cloud Computing and Big Data Analysis 2016 |
---|---|
Abbreviated title | ICCCBDA 2016 |
Country/Territory | China |
City | Chengdu |
Period | 5/07/16 → 7/07/16 |
Keywords
- binary relations
- definability
- lower and upper approximations
- rough sets