Abstract
Information systems contain preference ordered decision attributes now a day. To deal with them Dominance based Rough Set Approach (DRSA) is used. Two important concepts in DRSA are upper and lower approximations, both of them are computationally heavy algorithms. Reduction in its computational complexity helps in many advance applications of DRSA. Our proposed algorithm reduces its complexity by making changes in conventional procedure. Our solution stops the algorithm from precomputing the same thing from scratch. We tested our proposed solution on 5 datasets from UCI. There is 50% reduction in complexity of comparison step, which will lead to overall reduction of computational complexity for calculating lower and upper approximations.
| Original language | English |
|---|---|
| Title of host publication | 22nd International Conference on Advanced Communications Technology |
| Subtitle of host publication | Digital Security Global Agenda for Safe Society!, ICACT 2020 - Proceeding |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 571-576 |
| Number of pages | 6 |
| ISBN (Electronic) | 9791188428045 |
| DOIs | |
| State | Published - Feb 2020 |
| Externally published | Yes |
Publication series
| Name | International Conference on Advanced Communication Technology, ICACT |
|---|---|
| Volume | 2020 |
| ISSN (Print) | 1738-9445 |
Bibliographical note
Publisher Copyright:© 2020 Global IT Research Institute - GIRI.
Keywords
- Computational complexity
- Dominance-based Rough Set Approach
- Lower approximation
- Preference ordered decision attributes
- Upper approximation
ASJC Scopus subject areas
- Electrical and Electronic Engineering
Fingerprint
Dive into the research topics of 'Computationally Efficient Approximation Algorithm of Dominance Based Rough Set Approach'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver