Вы находитесь на странице: 1из 10

| ›

Rough Theory

Roug
h

Set Interval Number Function


| ¬

Rough Set
The universe  0 
   

The upper
approximation of M

 uivalence Class
Rough set M


The lower
approximation of M

 |
 
| 
  
    u      ~ ë
The [
  
of set M:   {  ÿ    º { ë
The   
of set M:    {        - { ë
| ‰

Rough Set
U /E
Y1 Y2 Y3

Y4 Y5 Y6 Y7 {
Y8
Y9 Y10 Y11

Lower Approximation Upper Approximation


u ÿd d ë u ÿd d d d d d d dë
|  

Rough Interval & Rough Number

è Let  u     Ý ëbe a sequence such that 0  1  ...  Ý.


The partition generated by S on the real line R is given by

   ë       ë       ë  Ý G  Ý  Ý ëë

M
À0 À1 À2 À3 ƦƦƦƦƦ Àn

Lower Approximation UpperUpper


Lower Approximation Approximation
Approximation
= [ x1 , x2 ]= x2 =( x0 , x3 )= x3
| ·

Rough Function

X [     
         

X [  u    À¦   À¦   À¦       



  J © % 
   À V   À V  V   À for all  

X "n fact, every non-empty sequence F is a discretization


on  9 % , and generates a partition given by

          ~  ë
| Î

Rough Function
^iven:
U=[-3,7]  
F={f0, f1, f2, f3}  À¦   
 
 À¦ À¦


   
j ¦¦
À¦   
j¦ 
 
 À¦  j ¦¦
À
 

    
   
| ÿ

Rough Function
ù
: The lower and the upper approÀimations of
an arbitrary real function g(À in an approÀimation space
A=(UÀ, F are defined by

   

    
   

   Ñ      Ñ ë

    

  
   

   Ñ      Ñ ë
| å

 À¦¦ u   À¦
 À¦
 À¦¦ u 
 À¦
 À¦

  À¦¦ u  À¦
 À¦
À¦
   À¦¦ u  À¦


 À¦
À
 

À¦

 À ¦¦ u 
À¦
 À ¦¦ u  À ¦

^iven: U=[-3,7] , F
| ü

Rough Function
ù
: "f g(À is an arbitrary real function having

the definitions      u     , then the lower and
upper approÀimations of g(À are given by

  ¦ u     ¦ 
 ¦      ¦


  ¦ u    ¦   ¦     ¦

  "f  then g(À is rough, otherwise g(À is


eÀact.
| ›

Upper ½
Approximation 
½ À¦
½
½

Lower À¦
Approximation ½ 
À¦

 À ¦ u   À ¦   À ¦   À ¦
 

 À ¦ u   À ¦  À ¦  À ¦