Boosted sooty tern optimization algorithm for global optimization and feature selection
dc.authorscopusid | 43361385400 | |
dc.authorscopusid | 55391699600 | |
dc.authorscopusid | 55354654200 | |
dc.authorscopusid | 57219716093 | |
dc.authorscopusid | 57195676453 | |
dc.contributor.author | Houssein, Essam H. | |
dc.contributor.author | Oliva, D. | |
dc.contributor.author | Çelik, Emre | |
dc.contributor.author | Emam, M.M. | |
dc.contributor.author | Ghoniem, R.M. | |
dc.date.accessioned | 2023-07-26T11:53:53Z | |
dc.date.available | 2023-07-26T11:53:53Z | |
dc.date.issued | 2023 | |
dc.department | DÜ, Mühendislik Fakültesi, Elektrik-Elektronik Mühendisliği Bölümü | en_US |
dc.description.abstract | Feature selection (FS) represents an optimization problem that aims to simplify and improve the quality of highly dimensional datasets through selecting prominent features and eliminating redundant and irrelevant data to classify results better. The goals of FS comprise dimensionality reduction and enhancing the classification accuracy in general, accompanied by great significance in different fields like data mining applications, pattern classification, and data analysis. Using powerful optimization algorithms is crucial to obtaining the best subsets of information in FS. Different metaheuristics, such as the Sooty Tern Optimization Algorithm (STOA), help to optimize the FS problem. However, such kind of techniques tends to converge in sub-optimal solutions. To overcome this problem in the STOA, an improved version called mSTOA is introduced. It employs the balancing exploration/exploitation strategy, self-adaptive of the control parameters strategy, and population reduction strategy. The proposed approach is proposed for solving the FS problem, but also it has been validated over benchmark optimization problems from the CEC 2020. To assess the performance of the mSTOA, it has also been tested with different algorithms. The experiments in terms of FS provide qualitative and quantitative evidence of the capabilities of the mSTOA for extracting the optimal subset of features. Besides, statistical analyses and no-parametric tests were also conducted to validate the result obtained by the mSTOA in optimization. © 2022 Elsevier Ltd | en_US |
dc.identifier.doi | 10.1016/j.eswa.2022.119015 | |
dc.identifier.issn | 0957-4174 | |
dc.identifier.scopus | 2-s2.0-85140292803 | en_US |
dc.identifier.scopusquality | Q1 | en_US |
dc.identifier.uri | https://doi.org/10.1016/j.eswa.2022.119015 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12684/12646 | |
dc.identifier.volume | 213 | en_US |
dc.identifier.wos | WOS:000877842900001 | en_US |
dc.identifier.wosquality | Q1 | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.institutionauthor | Çelik, Emre | |
dc.language.iso | en | en_US |
dc.publisher | Elsevier Ltd | en_US |
dc.relation.ispartof | Expert Systems with Applications | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.snmz | $2023V1Guncelleme$ | en_US |
dc.subject | Dimensionality reduction | en_US |
dc.subject | Feature selection | en_US |
dc.subject | Metaheuristics | en_US |
dc.subject | Optimization algorithm | en_US |
dc.subject | Sooty Tern Optimization Algorithm (STOA) | en_US |
dc.subject | Classification (of information) | en_US |
dc.subject | Data mining | en_US |
dc.subject | Global optimization | en_US |
dc.subject | Heuristic algorithms | en_US |
dc.subject | Dimensionality reduction | en_US |
dc.subject | Feature selection problem | en_US |
dc.subject | Features selection | en_US |
dc.subject | Global feature | en_US |
dc.subject | Global optimisation | en_US |
dc.subject | Metaheuristic | en_US |
dc.subject | Optimization algorithms | en_US |
dc.subject | Optimization problems | en_US |
dc.subject | Sooty tern optimization algorithm | en_US |
dc.subject | Feature Selection | en_US |
dc.title | Boosted sooty tern optimization algorithm for global optimization and feature selection | en_US |
dc.type | Article | en_US |