Slide 1

Rough Theory

Roug
h

Set Interval Number Function

 Slide 2

Rough Set
The universe U / Equivalence relation E

The upper
approximation of M

Equivalence Class
Yi Rough set M

The lower
approximation of M

The Set-Approximation Space: A=(U,E)

The Partition: U / E  {Y1 , Y2 , ...., Ym }
The Lower approx. of set M: E* ( M )  {Y  U / E |Y  M }
The Upper approx. of set M: E * ( M )  {Y  U / E | Y  M  }
 Slide 3

Rough Set
U /E
Y1 Y2 Y3

M
Y4 Y5 Y6 Y7
Y8

Y9 Y10 Y11
Lower Approximation Upper Approximation
 {Y5 , Y6 }  {Y5 , Y6 , Y2 , Y3 , Y4 , Y7 , Y10 , Y11}
 Slide 4

Rough Interval & Rough Number

 Let S  {x0 , x1 ,..., xn } be a sequence such that x0  x1  ...  xn .
The partition generated by S on the real line R is given by
 ( S )  {{x0 }, ( x0 , x1 ),{x1}, ( x1 , x2 ),{x2 },..., ( xn1 , xn ),{xn }}

C
x0 x1 x2 x3 …………… xn

Lower Approximation UpperUpper

Lower Approximation Approximation
Approximation
= [ x 1 , x2 ] = x 2 =( x0 , x3=) x3
 Slide 5

Rough Function

 Let U be a non-empty set of objects representing the universe.

 { f 0 ( x), f1 ( x),...., f m ( x)}

F Let be a sequence of functions,
such that:
1. f :.U  R
2. f 0 ( x)  f1 ( x)  ... for
f m (all
x) . x U

In fact, every non-empty sequence F is a discretization

on V  U  R , and generates a partition given by
V / F  {C 0 , C1 , C 2 , ...., C 3m  2 }
 Slide 6

Rough Function
Given:
U=[-3,7] Upper
F={f0, f1, f2, f3} f 3 ( x) Approximatio
n of g(x)
g (x) f 2 ( x)
F * (Lower
C ( g ))
f 1 ( x) Approximatio
C (g )
n of g(x)
f 0 ( x) F* (C ( g ))
-3 0 7

C0 C2 C4 C6 C8
C1 C3 C5 C7 x
 Slide 7

Rough Function
Definition 1: The lower and the upper approximations of
an arbitrary real function g(x) in an approximation space
A=(UxR, F) are defined by
sup Fl , Fl  
F* ( g ( x))  
  , Fl  
Fl  { f ( x )  F | f ( x )  g ( x ) x  U }

inf Fu , Fu  
F ( g ( x ))  
*

  , Fu  
Fu  { f ( x )  F | f ( x)  g ( x ) x  U }
 Slide 8

F* (k ( x))  f 3 ( x)
k (x)
F * (k ( x))   
f 4 ( x)
f 3 ( x)

F* ( g ( x))  f1 ( x)
g (x)
F * ( g ( x))  f 3 ( x)
f 2 ( x)

f 1 ( x)
-3 0 7

f 0 ( x)
F* (h( x))   
h(x)
F * (h( x))  f1 ( x)
x

Given: U=[-3,7] , F
 Slide 9

Rough Function
Definition 2: If g(x) is an arbitrary real function having
g i ( x ) , i  1, 2,..., m
the definitions , then the lower and
upper approximations of g(x) are given by

g* ( x )  min{ g ( x ), g ( x ), ..... , g ( x )}
1 2 m

g ( x )  max{ g ( x ), g ( x ), ..... , g ( x )}
* 1 2 m

Remark: If m>1 then g(x) is rough, otherwise g(x) is

exact.
 Slide 10

P1

Upper P6
Approximatio
P2 g 3 ( x)
n
P3
P4
Lower g 2 ( x)
Approximatio
n
P5 g 1 ( x)

g * ( x )  max{ g 1 ( x ), g 2 ( x ), g 3 ( x )}
g* ( x )  min{ g 1 ( x ), g 2 ( x ), g 3 ( x )}