Reference Hub4
Approximations in Rough Sets vs Granular Computing for Coverings

Approximations in Rough Sets vs Granular Computing for Coverings

Guilong Liu, William Zhu
Copyright: © 2010 |Volume: 4 |Issue: 2 |Pages: 14
ISSN: 1557-3958|EISSN: 1557-3966|EISBN13: 9781609603984|DOI: 10.4018/jcini.2010040105
Cite Article Cite Article

MLA

Liu, Guilong, and William Zhu. "Approximations in Rough Sets vs Granular Computing for Coverings." IJCINI vol.4, no.2 2010: pp.63-76. http://doi.org/10.4018/jcini.2010040105

APA

Liu, G. & Zhu, W. (2010). Approximations in Rough Sets vs Granular Computing for Coverings. International Journal of Cognitive Informatics and Natural Intelligence (IJCINI), 4(2), 63-76. http://doi.org/10.4018/jcini.2010040105

Chicago

Liu, Guilong, and William Zhu. "Approximations in Rough Sets vs Granular Computing for Coverings," International Journal of Cognitive Informatics and Natural Intelligence (IJCINI) 4, no.2: 63-76. http://doi.org/10.4018/jcini.2010040105

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Rough set theory is an important technique in knowledge discovery in databases. Classical rough set theory proposed by Pawlak is based on equivalence relations, but many interesting and meaningful extensions have been made based on binary relations and coverings, respectively. This paper makes a comparison between covering rough sets and rough sets based on binary relations. This paper also focuses on the authors’ study of the condition under which the covering rough set can be generated by a binary relation and the binary relation based rough set can be generated by a covering.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.