 |
In the second step, our proposed method update approximation sets using four heuristic rules. In rule 1, it has been given that to update lower approximation for downward union of classes of class ¡®t¡¯, check if object ¡®x¡¯ exists in it, delete it from this approximation set and simultaneously delete ¡®x¡¯ from lower approximation for downward union of classes of more preferred class than class ¡®t¡¯. To update upper approximation for downward union of classes of class ¡®t¡¯, delete object ¡®x¡¯ from upper approximation for downward union of classes of class ¡®t¡¯, without any computation. Simultaneously, delete ¡®x¡¯ from upper approximation for downward union of classes of more preferred class than class ¡®t¡¯ if t ¡Â 2. We compare object ¡®x¡¯ with object ¡®y¡¯ of more preferred class than ¡®t¡¯, if ¡®x¡¯ is more preferred than object ¡®y¡¯, delete ¡®y¡¯ from upper approximation for downward union of classes of class ¡®t¡¯.
|
IEEE/ICACT20220156 Slide.22
[Big Slide]