Definability of rough approximations for binary relations and cloud computing

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

doi:10.1109/ICCCBDA.2016.7529563

Definability of rough approximations for binary relations and cloud computing

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

Department of Accounting

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Other › peer-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 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	https://doi.org/10.1109/ICCCBDA.2016.7529563
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

Access to Document

10.1109/ICCCBDA.2016.7529563

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

@inproceedings{82af7f25c9ee402e95c5adbeb843cdf3,

title = "Definability of rough approximations for binary relations and cloud computing",

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.",

keywords = "binary relations, definability, lower and upper approximations, rough sets",

author = "Yu-Ru Syau and Ly-Fie Sugianto and En-Bing Lin",

year = "2016",

doi = "10.1109/ICCCBDA.2016.7529563",

language = "English",

isbn = "9781509025954",

pages = "233--236",

editor = "Qing Tan and En-Bing Lin and Tianrui Li",

booktitle = "Proceedings of 2016 IEEE International Conference on Cloud Computing and Big Data Analysis (ICCCBDA 2016)",

publisher = "IEEE, Institute of Electrical and Electronics Engineers",

address = "United States of America",

note = "IEEE International Conference on Cloud Computing and Big Data Analysis 2016, ICCCBDA 2016 ; Conference date: 05-07-2016 Through 07-07-2016",

}

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). IEEE, Institute of Electrical and Electronics Engineers, NY USA, pp. 233-236, IEEE International Conference on Cloud Computing and Big Data Analysis 2016, Chengdu, China, 5/07/16. https://doi.org/10.1109/ICCCBDA.2016.7529563

Definability of rough approximations for binary relations and cloud computing. / Syau, Yu-Ru; Sugianto, Ly-Fie; Lin, En-Bing.
Proceedings of 2016 IEEE International Conference on Cloud Computing and Big Data Analysis (ICCCBDA 2016). ed. / Qing Tan; En-Bing Lin; Tianrui Li. NY USA: IEEE, Institute of Electrical and Electronics Engineers, 2016. p. 233-236.

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Other › peer-review

TY - GEN

T1 - Definability of rough approximations for binary relations and cloud computing

AU - Syau, Yu-Ru

AU - Sugianto, Ly-Fie

AU - Lin, En-Bing

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

KW - binary relations

KW - definability

KW - lower and upper approximations

KW - rough sets

UR - http://www.scopus.com/inward/record.url?scp=84983354773&partnerID=8YFLogxK

U2 - 10.1109/ICCCBDA.2016.7529563

DO - 10.1109/ICCCBDA.2016.7529563

M3 - Conference Paper

AN - SCOPUS:84983354773

SN - 9781509025954

SP - 233

EP - 236

BT - Proceedings of 2016 IEEE International Conference on Cloud Computing and Big Data Analysis (ICCCBDA 2016)

A2 - Tan, Qing

A2 - Lin, En-Bing

A2 - Li, Tianrui

PB - IEEE, Institute of Electrical and Electronics Engineers

CY - NY USA

T2 - IEEE International Conference on Cloud Computing and Big Data Analysis 2016

Y2 - 5 July 2016 through 7 July 2016

ER -

Definability of rough approximations for binary relations and cloud computing

Abstract

Conference

Keywords

Access to Document

Other files and links

Cite this