Covering Based Pessimistic Multigranular Approximate Rough Equalities and Their Properties

Covering Based Pessimistic Multigranular Approximate Rough Equalities and Their Properties

Balakrushna Tripathy, Radha Raman Mohanty
Copyright: © 2018 |Volume: 5 |Issue: 1 |Pages: 21
ISSN: 2334-4598|EISSN: 2334-4601|EISBN13: 9781522547013|DOI: 10.4018/IJRSDA.2018010105
Cite Article Cite Article

MLA

Tripathy, Balakrushna, and Radha Raman Mohanty. "Covering Based Pessimistic Multigranular Approximate Rough Equalities and Their Properties." IJRSDA vol.5, no.1 2018: pp.58-78. http://doi.org/10.4018/IJRSDA.2018010105

APA

Tripathy, B. & Mohanty, R. R. (2018). Covering Based Pessimistic Multigranular Approximate Rough Equalities and Their Properties. International Journal of Rough Sets and Data Analysis (IJRSDA), 5(1), 58-78. http://doi.org/10.4018/IJRSDA.2018010105

Chicago

Tripathy, Balakrushna, and Radha Raman Mohanty. "Covering Based Pessimistic Multigranular Approximate Rough Equalities and Their Properties," International Journal of Rough Sets and Data Analysis (IJRSDA) 5, no.1: 58-78. http://doi.org/10.4018/IJRSDA.2018010105

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Rough set model introduced by Pawlak in 1982 was dependent upon equivalence relations (equivalently on partitions), which had restricted its application due to its stringent requirements. The notion of covering is an extension of that of a partition and is generated by relations much less restricted than equivalence relations. Several covering based rough sets are found in literature. As the notion of rough sets, basic or otherwise are unigranular from the granular computing point of view, in order to handle more than one granular structures on a universe simultaneously, optimistic and pessimistic multigranular computing were introduced by Qian et al in 2006 and 2010 respectively. Combining the two concepts of covering and multigranulation, covering based multigranular models were introduced by Liu et al in 2012. The notion of mathematical equality of concepts is too stringent and less applicable in real life situations. In order to incorporate human knowledge into it, four types of approximate equalities basing upon rough sets were introduced by Novotny and Pawlak in 1985 and by Tripathy in 2011. In this paper, we study the covering based pessimistic multigranular approximate rough equalities and establish several of their properties and provide suitable examples for illustration and in constructing counter examples in the proofs. This is an attempt to generalize the notion of approximate equalities by one more level in order to extend their applicability.

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.