Definability of rough approximations for binary relations and cloud computing

Yu-Ru Syau, Ly-Fie Sugianto, En-Bing Lin

Research output: Chapter in Book/Report/Conference proceedingConference PaperOtherpeer-review

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 languageEnglish
Title of host publicationProceedings of 2016 IEEE International Conference on Cloud Computing and Big Data Analysis (ICCCBDA 2016)
EditorsQing Tan, En-Bing Lin, Tianrui Li
Place of PublicationNY USA
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages233-236
Number of pages4
ISBN (Electronic)9781509025947
ISBN (Print)9781509025954
DOIs
Publication statusPublished - 2016
EventIEEE International Conference on Cloud Computing and Big Data Analysis 2016 - Southwest Jiaotong University, Chengdu, China
Duration: 5 Jul 20167 Jul 2016

Conference

ConferenceIEEE International Conference on Cloud Computing and Big Data Analysis 2016
Abbreviated titleICCCBDA 2016
CountryChina
CityChengdu
Period5/07/167/07/16

Keywords

  • binary relations
  • definability
  • lower and upper approximations
  • rough sets

Cite this

Syau, Y-R., Sugianto, L-F., & Lin, E-B. (2016). Definability of rough approximations for binary relations and cloud computing. In Q. Tan, E-B. Lin, & T. Li (Eds.), Proceedings of 2016 IEEE International Conference on Cloud Computing and Big Data Analysis (ICCCBDA 2016) (pp. 233-236). IEEE, Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ICCCBDA.2016.7529563