Fractional Calculus-Based Slime Mould Algorithm for Feature Selection Using Rough Set; IEEE Access; Vol. 9
| Источник: | IEEE Access Vol. 9.— 2021.— [P. 131625-131636] |
|---|---|
| Автор-организация: | |
| Другие авторы: | , , , , |
| Примечания: | Title screen Features Selection (FS) techniques have been applied to several real-world applications which contain high dimension data. These FS techniques have main objectives that aim to achieve them, such as removing irrelevant features and increasing classification accuracy. This is considered a bi-objectives optimization problem that requires a suitable technique that can balance between the objectives. So, different sets of FS techniques have been developed, and those techniques that depend on meta-heuristic (MH) established their performance overall traditional FS techniques. However, these MH approaches still require more enhancement to neutralize their exploration and exploitation abilities during the searching process. Enhancing the meta-heuristic optimization algorithm using the perspective of fractional calculus (FC) is an attractive and novel approach. In this paper, the slime mould algorithm (SMA) is modified using the FC for handling the optimizer drawback of the inefficient diversification phase. As a result, a fractional-order SMA is proposed to avoid the local solutions and discover the search landscape efficiently via considering a historic memorize of agents’ positions. The proposed FOSMA is applied to extract features from a set of real-world data and increase classification accuracy. For boosting the optimizer performance while processing with these datasets, the rough set (RS) is used as the fitness function to handle the uncertainty inside the real-world data. Finally, the proposed FOSMA’s results are compared with a set of well-known FS techniques to investigate its performance. The comparison illustrates the superiority of FOSMA in providing high accuracy. |
| Язык: | английский |
| Опубликовано: |
2021
|
| Предметы: | |
| Online-ссылка: | https://doi.org/10.1109/ACCESS.2021.3111121 |
| Формат: | Электронный ресурс Статья |
| Запись в KOHA: | https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=667691 |
MARC
| LEADER | 00000naa0a2200000 4500 | ||
|---|---|---|---|
| 001 | 667691 | ||
| 005 | 20250404164344.0 | ||
| 035 | |a (RuTPU)RU\TPU\network\38902 | ||
| 090 | |a 667691 | ||
| 100 | |a 20220413d2021 k||y0rusy50 ba | ||
| 101 | 0 | |a eng | |
| 102 | |a US | ||
| 135 | |a drcn ---uucaa | ||
| 181 | 0 | |a i | |
| 182 | 0 | |a b | |
| 200 | 1 | |a Fractional Calculus-Based Slime Mould Algorithm for Feature Selection Using Rough Set |f R. A. Ibrahim, D. Yousri, A. M. Mokhamed Elsaed (Mohamed Abd Elaziz) [et al.] | |
| 203 | |a Text |c electronic | ||
| 300 | |a Title screen | ||
| 320 | |a [References: 65 tit.] | ||
| 330 | |a Features Selection (FS) techniques have been applied to several real-world applications which contain high dimension data. These FS techniques have main objectives that aim to achieve them, such as removing irrelevant features and increasing classification accuracy. This is considered a bi-objectives optimization problem that requires a suitable technique that can balance between the objectives. So, different sets of FS techniques have been developed, and those techniques that depend on meta-heuristic (MH) established their performance overall traditional FS techniques. However, these MH approaches still require more enhancement to neutralize their exploration and exploitation abilities during the searching process. Enhancing the meta-heuristic optimization algorithm using the perspective of fractional calculus (FC) is an attractive and novel approach. In this paper, the slime mould algorithm (SMA) is modified using the FC for handling the optimizer drawback of the inefficient diversification phase. As a result, a fractional-order SMA is proposed to avoid the local solutions and discover the search landscape efficiently via considering a historic memorize of agents’ positions. The proposed FOSMA is applied to extract features from a set of real-world data and increase classification accuracy. For boosting the optimizer performance while processing with these datasets, the rough set (RS) is used as the fitness function to handle the uncertainty inside the real-world data. Finally, the proposed FOSMA’s results are compared with a set of well-known FS techniques to investigate its performance. The comparison illustrates the superiority of FOSMA in providing high accuracy. | ||
| 461 | |t IEEE Access | ||
| 463 | |t Vol. 9 |v [P. 131625-131636] |d 2021 | ||
| 610 | 1 | |a труды учёных ТПУ | |
| 610 | 1 | |a электронный ресурс | |
| 610 | 1 | |a feature selection | |
| 610 | 1 | |a fractional calculus | |
| 610 | 1 | |a slime mould algorithm | |
| 610 | 1 | |a meta-heuristic | |
| 610 | 1 | |a дробное исчисление | |
| 610 | 1 | |a алгоритмы | |
| 701 | 1 | |a Ibrahim |b R. A. |g Rehab Ali | |
| 701 | 1 | |a Yousri |b D. |g Dalia | |
| 701 | 1 | |a Mokhamed Elsaed (Mohamed Abd Elaziz) |b A. M. |c Specialist in the field of informatics and computer technology |c Professor of Tomsk Polytechnic University |f 1987- |g Akhmed Mokhamed |3 (RuTPU)RU\TPU\pers\46943 | |
| 701 | 1 | |a Alshathri |b S. |g Samah | |
| 701 | 1 | |a Attiya |b I. |g Ibrahim | |
| 712 | 0 | 2 | |a Национальный исследовательский Томский политехнический университет |b Инженерная школа информационных технологий и робототехники |b Отделение информационных технологий |3 (RuTPU)RU\TPU\col\23515 |
| 801 | 0 | |a RU |b 63413507 |c 20220413 |g RCR | |
| 856 | 4 | |u https://doi.org/10.1109/ACCESS.2021.3111121 | |
| 942 | |c CF | ||