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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of engineering (Stevenage, England) Ročník 2018; číslo 16; s. 1538 - 1543
Hlavní autoři: Yu, Peiqiu, Li, Jinjin, Lin, Guoping
Médium: Journal Article
Jazyk:angličtina
Vydáno: The Institution of Engineering and Technology 01.11.2018
Témata:
approximation computation
approximation theory
computational complexity
MGRS
multigranulation rough set
rough set model
rough set theory
The 2nd 2018 Asian Conference on Artificial Intelligence Technology (ACAIT 2018)
time complexity
vectors
vector‐based algorithm
vector‐based approaches
approximation theory
multigranulation rough set
vectors
vector-based algorithm
time complexity
vector-based approaches
rough set theory
approximation computation
rough set model
computational complexity
MGRS
ISSN:2051-3305, 2051-3305
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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