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 contributionpeer-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
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages233-236
Number of pages4
ISBN (Electronic)9781509025930
DOIs
StatePublished - Aug 2 2016
Event2016 IEEE International Conference on Cloud Computing and Big Data Analysis, ICCCBDA 2016 - Chengdu, China
Duration: Jul 5 2016Jul 7 2016

Publication series

NameProceedings of 2016 IEEE International Conference on Cloud Computing and Big Data Analysis, ICCCBDA 2016

Conference

Conference2016 IEEE International Conference on Cloud Computing and Big Data Analysis, ICCCBDA 2016
Country/TerritoryChina
CityChengdu
Period07/5/1607/7/16

Keywords

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

Fingerprint

Dive into the research topics of 'Definability of rough approximations for binary relations and cloud computing'. Together they form a unique fingerprint.

Cite this