| Virual Oral Presentation Slide by Slide |
IEEE/ICACT20220156 Slide.15
[Big Slide]
| Oral Presentation |
|
|
It is computational expensive to compute approximations using conventional dominance based rough set theory in terms of time and complexity. In case of real time applications where data changes over time, approximations need to be updated periodically. If we use traditional DRSA algorithm, it poses significant performance bottleneck for large size datasets. | |
| [Go to Next Slide] |