Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.13091/239
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Baş, Emine | - |
dc.contributor.author | Ülker, Erkan | - |
dc.date.accessioned | 2021-12-13T10:23:54Z | - |
dc.date.available | 2021-12-13T10:23:54Z | - |
dc.date.issued | 2020 | - |
dc.identifier.issn | 0957-4174 | - |
dc.identifier.issn | 1873-6793 | - |
dc.identifier.uri | https://doi.org/10.1016/j.eswa.2020.113185 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.13091/239 | - |
dc.description.abstract | The social spider algorithm (SSA) is a heuristic algorithm created on spider behaviors to solve continuous problems. In this paper, firstly a binary version of the social spider algorithm called binary social spider algorithm (BinSSA) is proposed. Currently, there is insufficient focus on the binary version of SSA in the literature. The main part of the binary version is the transfer function. The transfer function is responsible for mapping continuous search space to binary search space. In this study, eight of the transfer functions divided into two families, S-shaped and V-shaped, are evaluated. BinSSA is obtained from SSA, by transforming constant search space to binary search space with eight different transfer functions (S-Shapes and V-Shaped). Thus, eight different variations of BinSSA are formed as BinSSA1, BinSSA2, BinSSA3, BinSSA4, BinSSA5, BinSSA6, BinSSA7, and BinSSA8. For increasing, exploration and exploitation capacity of BinSSA, a crossover operator is added as BinSSA-CR. In secondly, the performances of BinSSA variations are tested on feature selection task. The optimal subset of features is a challenging problem in the process of feature selection. In this paper, according to different comparison criteria (mean of fitness values, the standard deviation of fitness values, the best of fitness values, the worst of fitness values, accuracy values, the mean number of the selected features, CPU time), the best BinSSA variation is detected. In the feature selection problem, the K-nearest neighbor (K-NN) and support vector machines (SVM) are used as classifiers. A detailed study is performed for the fixed parameter values used in the fitness function. BinSSA is evaluated on low-scaled, middle-scaled and large-scaled twenty-one well-known UCI datasets and obtained results are compared with state-of-art algorithms in the literature. Obtained results have shown that BinSSA and BinSSA-CR show superior performance and offer quality and stable solutions. (C) 2020 Elsevier Ltd. All rights reserved. | en_US |
dc.language.iso | en | en_US |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | en_US |
dc.relation.ispartof | EXPERT SYSTEMS WITH APPLICATIONS | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Social Spider Algorithm | en_US |
dc.subject | Feature Selection | en_US |
dc.subject | Classifiers | en_US |
dc.subject | Particle Swarm Optimization | en_US |
dc.subject | Feature Subset-Selection | en_US |
dc.subject | Genetic Algorithm | en_US |
dc.subject | Classification | en_US |
dc.subject | Reduction | en_US |
dc.title | An efficient binary social spider algorithm for feature selection problem | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1016/j.eswa.2020.113185 | - |
dc.identifier.scopus | 2-s2.0-85077751840 | en_US |
dc.department | Fakülteler, Mühendislik ve Doğa Bilimleri Fakültesi, Bilgisayar Mühendisliği Bölümü | en_US |
dc.authorid | Ulker, Erkan/0000-0003-4393-9870 | - |
dc.authorwosid | Ulker, Erkan/ABA-5846-2020 | - |
dc.identifier.volume | 146 | en_US |
dc.identifier.wos | WOS:000519653400024 | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.authorscopusid | 57213265310 | - |
dc.authorscopusid | 23393979800 | - |
dc.identifier.scopusquality | Q2 | - |
item.languageiso639-1 | en | - |
item.fulltext | With Fulltext | - |
item.cerifentitytype | Publications | - |
item.openairetype | Article | - |
item.grantfulltext | embargo_20300101 | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
crisitem.author.dept | 02.03. Department of Computer Engineering | - |
Appears in Collections: | Mühendislik ve Doğa Bilimleri Fakültesi Koleksiyonu Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collections |
Files in This Item:
File | Size | Format | |
---|---|---|---|
1-s2.0-S0957417420300117-main.pdf Until 2030-01-01 | 6.83 MB | Adobe PDF | View/Open Request a copy |
CORE Recommender
SCOPUSTM
Citations
21
checked on Apr 20, 2024
WEB OF SCIENCETM
Citations
31
checked on Apr 20, 2024
Page view(s)
102
checked on Apr 22, 2024
Download(s)
6
checked on Apr 22, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.