Vector-based approaches for computing approximations in multigranulation rough set
Approximation computation is a significant issue when the rough set model is applied. However, few authors focus on how to calculate approximations of multigranulation rough set (MGRS). Herein, the authors clarify a fact that only a part of elements in the universe need to be judged whether they bel...
Gespeichert in:
| Veröffentlicht in: | Journal of engineering (Stevenage, England) Jg. 2018; H. 16; S. 1538 - 1543 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
The Institution of Engineering and Technology
01.11.2018
|
| Schlagworte: | |
| ISSN: | 2051-3305, 2051-3305 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | Approximation computation is a significant issue when the rough set model is applied. However, few authors focus on how to calculate approximations of multigranulation rough set (MGRS). Herein, the authors clarify a fact that only a part of elements in the universe need to be judged whether they belong to approximations of MGRS. If X is a target concept which is approximated by approximations in MGRS, then the element whose equivalence class does not intersect with X is of no need to be judged. Based on the fact, the authors clarify that they proposed a vector-based algorithm to compute approximations in MGRS. Time complexity of the proposed algorithm is $O\lpar {\vert X\vert} {\vert U\vert} \rpar $O(|X||U|). |
|---|---|
| ISSN: | 2051-3305 2051-3305 |
| DOI: | 10.1049/joe.2018.8317 |