Covering Based Pessimistic Multigranular Approximate Rough Equalities and Their Properties

Covering Based Pessimistic Multigranular Approximate Rough Equalities and Their Properties

Balakrushna Tripathy (VIT University, School of Computing Science and Engineering, Vellore, India) and Radha Raman Mohanty (Indira Memorial College, Odisha, India)
Copyright: © 2018 |Pages: 21
DOI: 10.4018/IJRSDA.2018010105
OnDemand PDF Download:
$30.00
List Price: $37.50

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.
Article Preview

Introduction

Data in real life are mostly imprecise in nature and so the conventional tools for formal modeling, reasoning and computing, which are crisp, deterministic and precise in characteristics, are inadequate to handle them. The notion of Rough set introduced by Pawlak (Pawlak, 1982) is one of the most efficient models to handle such imprecision in data. Applications as realistic as done in (Sharmila et al., 2016) and (Vashist, 2014) provide enough evidence. However, its definition depends upon equivalence relations, which are relatively rare in nature. So, many extensions of basic rough sets have been proposed in the literature and covering based rough sets, which are defined by using covers instead of partitions over universes are some such extensions Yao et al., 2012). An extensive account of its extension to the context of fuzzy approximation space and intuitionistic fuzzy approximation spaces is provided in (Tripathy, 2009a). Rough set theory is useful in the field of data mining as is shown in (Rana et al., 2016). Probabilistic flavour is added to the uncertainty based model of rough sets to enhance its applicability as is done in (Haldar, 2014).

The topic of fuzzy information granulation was first proposed and discussed by L.A. Zadeh in 1979 (Zadeh, 1979). It did not attend much attention till he revived it in a seminal paper in 1997 (Zadeh, 1997). Granulation of an object ‘A’ leads to a collection of granules of A, with a granule being a clump of points (objects) drawn together by indiscernibility, similarity, proximity or functionality (Yao, 2005). The theory of fuzzy information granulation (TFIG) is inspired by the ways in which humans granulate information and reason with it. Granular computing is a superset of the theory of fuzzy information granulation, rough set theory and interval computations, and is a subset of granular mathematics. An underlying idea of granular computing is the use of groups, classes or clusters of elements called granules. From a philosophical and theoretical point of view, many authors argued that information granulation is very essential to human problem solving and hence has a very significant impact on the design and implementation of intelligent systems.

From the point of view of granular computing, basic rough set theory deals with single granulation (Qian et al., 2006). However, in some application areas we need to handle more than one granulation at a time and this necessitated the development of multi-granular rough sets (MGRS), where at least two equivalence relations are taken for granulation of a universe. This concept is further extended by considering covers and this led to the development of covering based multi granular rough sets (CBMGRS) (Lin et al., 2011; Liu et al., 2011). Four types of CBMGRS are defined and their properties are established.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 5: 4 Issues (2018): 1 Released, 3 Forthcoming
Volume 4: 4 Issues (2017)
Volume 3: 4 Issues (2016)
Volume 2: 2 Issues (2015)
Volume 1: 2 Issues (2014)
View Complete Journal Contents Listing