Positive Region Reduct Based on Relative Discernibility and Acceleration Strategy
| العنوان: | Positive Region Reduct Based on Relative Discernibility and Acceleration Strategy |
|---|---|
| المؤلفون: | Chuanjian Yang, Hao Ge, Longshu Li |
| المصدر: | International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems. 26:521-551 |
| بيانات النشر: | World Scientific Pub Co Pte Lt, 2018. |
| سنة النشر: | 2018 |
| مصطلحات موضوعية: | Reduct, 0102 computer and information sciences, 02 engineering and technology, Key issues, 01 natural sciences, Classical type, Reduction (complexity), Acceleration, 010201 computation theory & mathematics, Artificial Intelligence, Control and Systems Engineering, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Rough set, Algorithm, Software, Information Systems, Mathematics |
| الوصف: | Attribute reduction is one of key issues in rough set theory, and positive region reduct is a classical type of reducts. However, a lot of reduction algorithms have more high time expenses when dealing with high-volume and high-dimensional data sets. To overcome this shortcoming, in this paper, a relative discernibility reduction method based on the simplified decision table of the original decision table is researched for obtaining positive region reduct. Moreover, to further improve performance of reduction algorithm, we develop an accelerator for attribute reduction, which reduces the radix sort times of the reduction process to raise algorithm efficiency. By the accelerator, two positive region reduction algorithms, i.e., FARA-RS and BARA-RS, based on the relative discernibility are designed. FARA-RS simultaneously reduce the size of the universe and the number of radix sort to achieve speedup and BARA-RS only reduce the number of radix sort to achieve acceleration. The experimental results show that the proposed reduction algorithms are effective and feasible for high dimensional and large data sets. |
| تدمد: | 1793-6411 0218-4885 |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_________::cacd9577ab73c55e75ff1a9e0cc6875e https://doi.org/10.1142/s0218488518500253 |
| رقم الأكسشن: | edsair.doi...........cacd9577ab73c55e75ff1a9e0cc6875e |
| قاعدة البيانات: | OpenAIRE |
| تدمد: | 17936411 02184885 |
|---|