Numerical characterizations of covering rough sets

based on evidence theory Chen Degang, Zhang Xiao

Department of Mathematics and Physics, North China Electric Power Univ

ersity, Beijing, 102206, P. R. China

Outline: 1. Introduction 2. Basic notions related to covering rough sets 3. Belief function and plausibility function of covering rough sets 4. Numerical characterizations of attribute reduction of covering information system 5. Numerical characterizations of attribute reduction of covering decision systems 6. Conclusions

What is covering rough sets?Covering rough sets are improvements of traditional rough sets by considering cover of universe instead of partition.

1. Introduction

Why do we need covering rough sets?Partition and equivalence relation are too restrictive to many applications. One response to this argument is to extend an equivalence relation to more general relations such as similarity relation [21], tolerance relation [4,20] or others [22,25,26]. Another response is to consider a cover instead of partition and obtain covering rough sets [1-3,5,9,16,28,29-32].

The existing study on covering rough setsZakowski employed coverings of universe to establish the generalized rough sets [28]. Bonikowski et al. [1] studied the structures of covers. Mordeson [9] examined the relationship between the approximations of sets defined with respect to covers and some axioms satisfied by traditional rough sets. Chen et al. [5] discussed the covering rough set under the framework of a complete completely distributive lattice. Zhu and Wang [29-32] compared three kinds of generalized rough sets to deal with vagueness and granularity in information system.

Chen et al.[6] began to develop definition and methods of attribute reduction with covering rough sets. In [6] the intersection of coverings was defined and the discernibility matrix was employed to compute all reducts. Their study established a theoretical foundation for attribute reduction of covering decision systems.

1. Introduction

Among these work on covering rough sets, less effort has been concentrated on developing measures for covering rough sets up to now. As well known, in traditional rough set theory different kinds of measures are proposed to reveal numerical characterizations of rough sets and applied to develop algorithms of finding reducts. This fact motivates our idea in this paper to develop measures to characterize covering rough sets numerically.

As pointed in [23,24], there is closed connection between rough set theory and evidence theory. This connection further motivates us to set up connection between covering rough sets and evidence theory, i.e., to characterize approximations and attribute reductions in covering rough sets by employing measures in evidence theory.

1. Introduction

Two facts motivate our idea

2. Basic notions related to covering rough setsWe recall the basic concepts related to covering rough sets [6]. Definition 2.1. Let be a universe, and a family of subsets of . is called a covering of if none elements in is empty and .

U C UC U C UC

1 2{ , , , }nC C CC Ux U { : , }x j j jC C C x C C ( ) { : }xCov C x U C

U C

Definition 2.2. Let be a covering of . For every , let , then

is also a covering of . We call it the induced covering of .

.

Definition 2.3. Let { : 1, , }i i m C be a family of coverings of U

. For every x U , let { : ( )}x ix ix iC C Cov C , then ( ) { : }xCov x U is also a covering of

U

. We call it the induced covering of .U

For every , the lower and the upper approximations of with respect to are defined as follows

X U X

( ) { : }x xX X ( ) { : }x xX X

The positive region . ( ) ( )Pos X X

In this section, we first discuss the property of lower approximation and propose a new upper approximation for covering rough sets.

Lemma 3.1. Let ( , )U be a covering information system and be a family of coverings of U . For and

, we have { : 1,..., }i i m CΔ x U X U

( ) { : } { : }x x xX X x X

In this paper, we define a new upper approximation of to the induced cover of as developed in terms of an induced cover, it certainly can be defined for arbitrary covering. Furthermore, we have the following conclusions.

. Here X with respect

*( ) { : }xX x X * is

3. Belief function and plausibility function of covering rough sets

3. Belief function and plausibility function of covering rough sets

Theorem 3.2. Suppose is a family of coverings of { : 1,..., }i i m CΔ

, the covering lower approximation U and upper approximation *

have the following properties:

( )X X *( )X X(1L) (Contraction) (1U) (Extension)

(2) (Duality) (Duality)

(3L) (Normality) (3U) (Normality)

(4L) (Co-normality) (4U) (Co-normality)

(5L) (Multiplication)(5U) (Addition)

(6L) (Monotone) (6U) (Monotone)

(7L) (Idempotency)(7U) (Idempotency)

*(~ ) ~ ( )X X *(~ ) ~ ( )X X ( ) *( ) ( )U U *( )U U

( ) ( ) ( )X Y X Y * * *( ) ( ) ( )X Y X Y

( ) ( )X Y X Y * *( ) ( )X Y X Y ( ( )) ( )X X * * *( ( )) ( )X X

3. Belief function and plausibility function of covering rough sets

Theorem 3.3. Let be a covering information system, ,

for any , denote

, .

Then and are belief and plausibility functions on

respectively, and the corresponding mass distribution is

here defined as ,

and .

( , )U 1 2{ , , , }nU x x x X U

( ) ( )Bel X X n *( ) ( )Pl X X n

Bel Pl U

1( ), ,( )

0,

ii

fXm X n

otherwise

Δ : ( )f U Cov Δ ( )i if x

1( ) { : ( ) }i k k if x f x

4. Numerical characterizations of attribute reduction of covering information system

The reduct of covering information systems is the minimal subset of

that preserves the induced c

overing .

( )Cov

Theorem 4.1. Let be a covering information system and be

a family of coverings, , , ,

then is a reduct of iff

, and for any nonempty subset , .

( , )S U

1 2{ , , , }nU x x x 1 2( ) { , , , }nCov P

P S

1

1( ) 1

n

ii i

Bel

P P P

1

1( ) 1

n

ii i

Bel

P

Theorem 4.2. Let be a covering information system and be

a family of coverings, , , ,

, then is a reduct of iff

, and for any nonempty subset , .

( , )S U

1 2{ , , , }nU x x x 1 2( ) { , , , }nCov P

P S

P P

1

1( )

n

ii i

Pl M

Δ

1

1( )

n

ii i

Pl M

P

1

1( )

n

ii i

Pl M

P'

4. Numerical characterizations of attribute reduction of covering information system

4. Numerical characterizations of attribute reduction of covering information system

From Theorem 4.1 and 4.2 we conclude that the purpose of attribute

reduction in covering information systems is to find a minimal subset

which preserves or . In

Theorem 4.3 may not hold since may not always hold.

Generally we always have even is a basic granule, and

this is one difference between covering rough sets and traditional

rough sets since every basic granule equals to its lower and upper

approximations in traditional rough sets.

Now we define the significance of a covering in in a covering

information system.

P1

( ) 1n

i ii

Bel

P

1

1( )

n

ii i

Pl M

P

1M ( )i i Δ

( )i i Δ i

4. Numerical characterizations of attribute reduction of covering information system

Definition 4.3. Let be a covering information system.

, we define the significance of the covering by

.

( , )S U

1 2{ , , , }nU x x x C Δ

{ }1 1

( ) ( ) ( )n n

i i i ii i

Sig Bel Bel

CCΔ Δ Δ

Theorem4.4. Let be a covering information system. For

every , is indispensable in in iff .

( , )S U

C Δ D ( ) 0Sig CΔC

Theorem 4.5. .( ) { : ( ) 0}Core Sig C CΔΔ Δ

Definition 4.6. Let be a covering information system.

, for every covering , we define the

significance of the covering relative to by

.

( , )S U

1 2{ , , , }nU x x x (CoreC Δ)

C ( )Core

( ( ) { } ( )1 1

( ) ( ) ( )n n

Core Core i i Core i ii i

Sig Bel Bel

CC Δ) Δ Δ

4. Numerical characterizations of attribute reduction of covering information system

Algorithm 1. Acquire the core and the reduct for a covering information system.

( )Core

C Δ { }1 1

( ) ( ) ( )n n

i i i ii i

Sig Bel Bel

CCΔ Δ Δ

ΔC ( ) 0Sig CΔ( )Core

( ) 0Sig CΔ( ) ( ) { }Core Core CΔ Δ

( )1

( ) 1n

Core i ii

Bel

( )Core

(1) let ;

(2) for each , calculate

(3) if for every , , then , go to step (6);

(4) If , then let ;

(5) if then return , else go to step (6);

(6) let ;

(7) for each , calculate ;

(8) if , then ;

(9) if then stop and output as a reduct , else

go back to step (7).

( )CoreP

{ } C Δ P ( )Sig CP

{ } CP P

1

( ) 1n

i ii

Bel

P P

{ }( ) max ( )i iSig Sig CC CP Δ-P P

Let and , the time complexity of Algorithm 1 is . By Algorithm 1, we can acquire not only the core but also a proper reduct.

m U n 2 2( )O m n

5. Numerical characterizations of attribute reduction of covering decision systems

Similar to attribute reduction of decision systems in traditional rough sets, attribute reduction of covering decision systems aims to find the minimal set of conditional attributes to preserve the positive region of decision attribute [6].

Lemma 5.1. Let be a covering decision system,

, then we have .

( , , { })S U D d

1 2/ { , , , }rU D D D D 1

( ) ( )r

jj

Bel D Pos D U

Theorem 5.2. Let be a covering decision system,

, , , then is a relative reduct

of iff , and for any nonempty subset ,

.

( , , { })S U D d

1 2{ , , , }nU x x x P1 2/ { , , , }rU D D D D P

S1 1

( ) ( )r r

j jj j

Bel D Bel D

P P P

1 1

( ) ( )r r

j jj j

Bel D Bel D

P P

5. Numerical characterizations of attribute reduction of covering decision systems

Definition 5.3. Let be a covering decision system.

, for every , we define the significance of the covering relative to in by

( , , { })S U D d

1 2/ { , , , }rU D D D D C ΔC D

{ }1 1

( ) ( ) ( )r r

D j jj i

Sig Bel D Bel D

CCΔ Δ Δ

Theorem 5.4. Let be a covering decision system.

For every , is indispensable relative to in iff .

( , , { })S U D d

C Δ C D ( ) 0DSig CΔ

The covering decision systems can be divided into consistent covering

decision systems and inconsistent covering decision systems[6]. Generally

speaking, for covering decision systems, we only consider to find a minimal

subset of to preserve the sum of belief functions of all decision classes.

By Theorem 5.4 and the definition of , we have the following

result.

Theorem 5.5. .

( )DCore

( ) { : ( ) 0}D DCore Sig C CΔΔ Δ

Definition 5.6. Let be a covering decision system,

. For every but , we define the rela

tive significance of the covering to by

.

( , , { })S U D d

1 2/ { , , , }rU D D D D ( )i DCoreC C Δ

C ( )DCore

( ) ( ) { } ( )1 1

( ) ( ) ( )D D D

r r

Core Core j Core jj i

Sig Bel D Bel D

CC Δ Δ Δ

5. Numerical characterizations of attribute reduction of covering decision systems

Algorithm 2. Acquire the core and the reduction in a covering decision system.

( )Core

C Δ { }1 1

( ) ( ) ( )r r

D j jj i

Sig Bel D Bel D

CCΔ Δ Δ

ΔC ( ) 0DSig CΔ ( )DCore

( ) 0Sig CΔ D( ) ( ) { }D DCore Core CΔ Δ

( )1 1

( ) ( )r r

Core j jj j

Bel D Bel D

( )DCore

(1) let ;

(2) for each , calculate ;

(3) if for every , , then , go to step (6);

(4) If , then ;

(5) if then return , else go to

step (6);

(6) let ;

(7) for each , calculate ;

(8) if , then ;

(9) if then stop and output as a reduct ,

else go back to step (7).

( )DCoreP

{ } C Δ P { }1 1

( ) ( ) ( )r r

j jj i

Sig Bel D Bel D

CC P P P

{ }( ) max ( )i iSig Sig CC CP Δ-P P { } CP P

1 1

( ) ( )r r

j jj j

Bel D Bel D

P P

Let and , the time complexity of Algorithm 2 is . By Algorithm 2, we can acquire not only the core but also a proper reduct.

m U n 2 2( )O m n

The covering rough set theory is a generalization of traditional rough set theory characterized by covers instead of partitions. Since there is closed connection between rough set theory and evidence theory, we try to propose belief and plausibility functions to characterize covering rough sets. The relationships between attribute reduction and belief (plausibility) function are analyzed in covering information and decision systems respectively. We give the concepts of significance and relative significance of coverings to find reducts in covering information and decision systems. In addition, the relevant algorithms are designed. In a word, we develop a numerical method to find reducts by employing the belief function in covering information (decision) systems. Our future work will concentrate on developing other measures for covering rough sets based on belief and plausibility functions in this paper.

6. Conclusions

References[1] Z. Bonikowski, E. Bryniarski, U. Wybraniec, Extensions and intentions in the rough set theory, Information Sciences 107 (1998) 149–167.[2] Z. Bonikowski, Algebraic structures of rough sets, in: W. Ziarko (Ed.), Rough Sets, Fuzzy Sets and Knowledge Discovery, Springer-Verlag, London, 1994, pp. 243–247.[3] E. Bryniarski, A calculus of rough sets of the first order, Bulletin of the Polish Academy of Sciences 16 (1989) 71–77.[4] G. Cattaneo, Abstract approximate spaces for rough theories, in: Polkowski, Skowron (Eds.), Rough Sets in Knowledge Discovery1: Methodology and Applications, Physicaverlag, Heidelberg, 1998, pp. 59–98.[4] G. Cattaneo, Abstract approximation spaces for rough theories, in: L. Polkowski, A. Skowron (Eds.), Rough Sets in Knowledge Discovery 1: Methodology and Applications, Physica-Verlag, Heidelberg, 1998, pp. 59–98.[5] D.G. Chen, W.X. Zhang, S. Yeung, C.C. Tsang, Rough approximations on a complete completely distributive lattice with applications to generalized rough sets, Information Sciences 176 (2006) 1829–1848.[6] D.G. Chen, C.Z. Wang, Q.H. Hu, A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets, Information Sciences 177 (2007) 3500–3518.[7] A.P. Dempster, Upper and lower probabilities induced by a multi valued mapping, Annals ofMathematical Statistics 38 (1967) 325–339.[8] F. Li, Y.Q. Yin, Approaches to knowledge reduction of covering decision systems based on information theory, Information Sciences 179 (2009) 1694–1704.[9] J.N. Mordeson, Rough set theory applied to (fuzzy) ideal theory, Fuzzy Sets and Systems 121 (2001) 315–324.[10] H.S. Nguyen, D. Slezak, Approximation reducts and association rules correspondence and complexity results, in: N. Zhong, A. Skowron, S. Oshuga (Eds.), Proceedings of RSFDGrC’99, Yamaguchi, Japan. LNAI1711, 1999, pp. 137–145.

[11] Z. Pawlak, Rough sets, International Journal of Computer and Information Sciences 11 (1982) 341–356.[12] Z. Pawlak, Rough Sets: Theoretical Aspects of Reasoning About Data, Kluwer Academic Publishing, Dordrecht, 1991.[13] Z. Pawlak, Andrzej Skowron, Rudiments of rough sets, Information Sciences 177 (2006) 3–27.[14] Z. Pawlak, Andrzej Skowron, Rough sets: Some extensions, Information Sciences 177 (2006) 28–40.[15] Z. Pawlak, Andrzej Skowron, Rough sets and Boolean reasoning, Information Sciences 177 (2006) 41–73.[16] J.A. Pomykala, Approximation operations in approximation space, Bulletin of the Polish Academy of Sciences 9–10 (1987) 653–662.[17] G. Shafer, A Mathematical Theory of Evidence, Princeton University Press, Princeton, 1976.[18] A. Skowron, J. Grzymala-Busse, From rough set theory to evidence theory, in: R.R. Yager, M. Fedrizzi, J. Kacprzyk (Eds.), Advance in the Dempster–Shafer Theory of Evidence, Wiley, New York, 1994, pp. 193–236. [19] A. Skowron, C. Rauszer, The discernibility matrices and functions in information systems, in: R. Slowinsk (Ed.), Intelligent Decision support, Handbook of Applications and Advances of the Rough Sets Theory, Kluwer Academic Publishers, 1992.[20] A. Skowron, J. Stepaniuk, Tolerance approximation spaces, Fund. Inform. 27 (1996)245–253.[21] R. Slowinski, D. Vanderpooten, A generalized definition of rough approximations based on similarity, IEEE Trans. Knowledge Data Eng. 12 (2000) 331–336.[22] A. Wasilewska, Topological rough algebras, in: T.Y. Lin, N. Cercone (Eds.), Rough Sets & Data Mining, Kluwer Academic Publishers, Boston, 1997, pp. 425–441.[23] W. Z. Wu, Y. Leung, W.X. Zhang, Connections between rough set theory and Dempster– Shafer theory of evidence, International Journal of General Systems 31 (2002) 405–430.[24] W. Z. Wu, M. Zhang, H.Z. Li, J.S. Mi, Knowledge reduction in random information systems via Dempster–Shafer theory of evidence, Information Sciences 174 (2005) 143–164.[25] Y. Y. Yao, Constructive and algebraic methods of theory of rough sets, Inform. Sci. 109 (1998) 21–47.[26] Y. Y.Yao, Relational interpretations of neighborhood operators and rough set approximation operators, Inform. Sci. 111 (1998) 239–259.

[27] Y. Y. Yao, P. J. Lingras, Interpretations of belief functions in the theory of rough sets, Information Sciences 104 (1998) 81–106.[28] W. Zakowski, Approximations in the space , Demonstratio Math. 16(1983) 761–769.[29] W. Zhu, F.Y. Wang, Some results on the covering generalized rough sets, Pattern Recognition and Artificial Intelligence 5 (2002) 6–13.[30] W. Zhu, F.Y. Wang, Reduction and axiomization of covering generalized rough sets, Information Sciences 152 (2003) 217–230.[31] W. Zhu, Topological approaches to covering rough sets, Information Sciences 177 (2007) 1892–1915.[32] W. Zhu, F.Y. Wang, On three types of covering-based rough sets, IEEE Trans on Knowledge and Data Engineering, 19(2007)1131-1144[33] W. Ziarko, Variable precision rough set model, Journal of Computer and System Sciences 46 (1993) 39–59.