Improving binary crow search algorithm for feature selection

The feature selection (FS) process has an essential effect in solving many problems such as prediction, regression, and classification to get the optimal solution. For solving classification problems, selecting the most relevant features of a dataset leads to better classification accuracy with low...

Full description

Saved in:
Bibliographic Details
Published in:Journal of intelligent systems Vol. 32; no. 1; pp. 1598 - 610
Main Authors: Hamed Alnaish, Zakaria A., Algamal, Zakariya Yahya
Format: Journal Article
Language:English
Published: Berlin De Gruyter 16-02-2023
Walter de Gruyter GmbH
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The feature selection (FS) process has an essential effect in solving many problems such as prediction, regression, and classification to get the optimal solution. For solving classification problems, selecting the most relevant features of a dataset leads to better classification accuracy with low training time. In this work, a hybrid binary crow search algorithm (BCSA) based quasi-oppositional (QO) method is proposed as an FS method based on wrapper mode to solve a classification problem. The QO method was employed in tuning the value of flight length in the BCSA which is controlling the ability of the crows to find the optimal solution. To evaluate the performance of the proposed method, four benchmark datasets have been used which are human intestinal absorption, HDAC8 inhibitory activity (IC50), P-glycoproteins, and antimicrobial. Accordingly, the experimental results are discussed and compared against other standard algorithms based on the accuracy rate, the average number of selected features, and running time. The results have proven the robustness of the proposed method relied on the high obtained value of accuracy (84.93–95.92%), -mean (0.853–0.971%), and average selected features (4.36–11.8) with a relatively low computational time. Moreover, to investigate the effectiveness of the proposed method, Friedman test was used which declared that the performance supremacy of the proposed BCSA-QO with four datasets was very evident against BCSA and CSA by selecting the minimum relevant features and producing the highest accuracy classification rate. The obtained results verify the usefulness of the proposed method (BCSA-QO) in the FS with classification in terms of high classification accuracy, a small number of selected features, and low computational time.
AbstractList The feature selection (FS) process has an essential effect in solving many problems such as prediction, regression, and classification to get the optimal solution. For solving classification problems, selecting the most relevant features of a dataset leads to better classification accuracy with low training time. In this work, a hybrid binary crow search algorithm (BCSA) based quasi-oppositional (QO) method is proposed as an FS method based on wrapper mode to solve a classification problem. The QO method was employed in tuning the value of flight length in the BCSA which is controlling the ability of the crows to find the optimal solution. To evaluate the performance of the proposed method, four benchmark datasets have been used which are human intestinal absorption, HDAC8 inhibitory activity (IC50), P-glycoproteins, and antimicrobial. Accordingly, the experimental results are discussed and compared against other standard algorithms based on the accuracy rate, the average number of selected features, and running time. The results have proven the robustness of the proposed method relied on the high obtained value of accuracy (84.93–95.92%), -mean (0.853–0.971%), and average selected features (4.36–11.8) with a relatively low computational time. Moreover, to investigate the effectiveness of the proposed method, Friedman test was used which declared that the performance supremacy of the proposed BCSA-QO with four datasets was very evident against BCSA and CSA by selecting the minimum relevant features and producing the highest accuracy classification rate. The obtained results verify the usefulness of the proposed method (BCSA-QO) in the FS with classification in terms of high classification accuracy, a small number of selected features, and low computational time.
Abstract The feature selection (FS) process has an essential effect in solving many problems such as prediction, regression, and classification to get the optimal solution. For solving classification problems, selecting the most relevant features of a dataset leads to better classification accuracy with low training time. In this work, a hybrid binary crow search algorithm (BCSA) based quasi-oppositional (QO) method is proposed as an FS method based on wrapper mode to solve a classification problem. The QO method was employed in tuning the value of flight length in the BCSA which is controlling the ability of the crows to find the optimal solution. To evaluate the performance of the proposed method, four benchmark datasets have been used which are human intestinal absorption, HDAC8 inhibitory activity (IC50), P-glycoproteins, and antimicrobial. Accordingly, the experimental results are discussed and compared against other standard algorithms based on the accuracy rate, the average number of selected features, and running time. The results have proven the robustness of the proposed method relied on the high obtained value of accuracy (84.93–95.92%), G -mean (0.853–0.971%), and average selected features (4.36–11.8) with a relatively low computational time. Moreover, to investigate the effectiveness of the proposed method, Friedman test was used which declared that the performance supremacy of the proposed BCSA-QO with four datasets was very evident against BCSA and CSA by selecting the minimum relevant features and producing the highest accuracy classification rate. The obtained results verify the usefulness of the proposed method (BCSA-QO) in the FS with classification in terms of high classification accuracy, a small number of selected features, and low computational time.
The feature selection (FS) process has an essential effect in solving many problems such as prediction, regression, and classification to get the optimal solution. For solving classification problems, selecting the most relevant features of a dataset leads to better classification accuracy with low training time. In this work, a hybrid binary crow search algorithm (BCSA) based quasi-oppositional (QO) method is proposed as an FS method based on wrapper mode to solve a classification problem. The QO method was employed in tuning the value of flight length in the BCSA which is controlling the ability of the crows to find the optimal solution. To evaluate the performance of the proposed method, four benchmark datasets have been used which are human intestinal absorption, HDAC8 inhibitory activity (IC50), P-glycoproteins, and antimicrobial. Accordingly, the experimental results are discussed and compared against other standard algorithms based on the accuracy rate, the average number of selected features, and running time. The results have proven the robustness of the proposed method relied on the high obtained value of accuracy (84.93–95.92%), G-mean (0.853–0.971%), and average selected features (4.36–11.8) with a relatively low computational time. Moreover, to investigate the effectiveness of the proposed method, Friedman test was used which declared that the performance supremacy of the proposed BCSA-QO with four datasets was very evident against BCSA and CSA by selecting the minimum relevant features and producing the highest accuracy classification rate. The obtained results verify the usefulness of the proposed method (BCSA-QO) in the FS with classification in terms of high classification accuracy, a small number of selected features, and low computational time.
Author Hamed Alnaish, Zakaria A.
Algamal, Zakariya Yahya
Author_xml – sequence: 1
  givenname: Zakaria A.
  surname: Hamed Alnaish
  fullname: Hamed Alnaish, Zakaria A.
  email: zakriahamoalnaish@uomosul.edu.iq
  organization: College of Sciences, University of Mosul, 41001 Mosul, Iraq
– sequence: 2
  givenname: Zakariya Yahya
  surname: Algamal
  fullname: Algamal, Zakariya Yahya
  email: zakariya.algamal@uomosul.edu.iq
  organization: College of Engineering, University of Warith Al-Anbiyaa, 56001 Karbala, Iraq
BookMark eNp1kM9LwzAUx4NMcM6dvRY81zVpkjbiRYY_BgMvCt7Ca_vatXTNTFpl_73ZKurFQMiXvPf95uVzTiad6ZCQSxpdU0HFoqnd3oUsYiz0Oz0hU0YV9Vq-Tf7oMzJ3ron84oqKVEzJ7Wq7s-aj7qogqzuw-yC35jNwCDbfBNBWxtb9ZhuUxgYlQj9Y9MUW87423QU5LaF1OP8-Z-T14f5l-RSunx9Xy7t1mHOW9CGDIuaRRB4VKSjABFJeUmReAuNciIKpLE1AKMFiBCkLxVUMEqjyNSHiGVmNuYWBRu9svfWDagO1Pl4YW2mwfZ23qIssV1JJUVAVc6lipTCPMecc0ijKgPmsqzHLf_t9QNfrxgy28-NrliTeyhSXvmsxdnkazlksf16lkT4Q10fi-kBcH4h7x83o-IS2R1tgZYe9F7_x_zkZjb8APyaJIA
CitedBy_id crossref_primary_10_35784_iapgos_4569
crossref_primary_10_3233_IDT_230307
Cites_doi 10.1016/j.asoc.2018.06.040
10.1007/s00521-017-2988-6
10.1007/s00521-022-07203-7
10.1016/j.swevo.2021.101022
10.1109/CEC.2018.8477975
10.1109/ACCESS.2021.3135805
10.1007/s00521-018-3688-6
10.1016/j.chemolab.2014.06.011
10.1016/j.procs.2020.03.420
10.1080/1062936X.2015.1040453
10.1109/ACCESS.2019.2897325
10.1016/j.compstruc.2016.03.001
10.1515/jisys-2019-0062
10.1109/JEEIT.2019.8717491
10.1155/2022/5974634
10.1007/s00500-019-03988-3
10.1016/j.chemolab.2015.08.015
10.1016/j.knosys.2021.107034
10.1016/j.neucom.2015.06.083
10.1016/j.eswa.2021.116431
10.1007/978-981-10-8863-6_9
10.1016/j.chemolab.2021.104288
10.1016/j.mlwa.2021.100108
10.1016/j.eswa.2020.114288
10.1007/978-981-15-5281-6_34
ContentType Journal Article
Copyright 2023. This work is published under http://creativecommons.org/licenses/by/4.0 (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2023. This work is published under http://creativecommons.org/licenses/by/4.0 (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID AAYXX
CITATION
JQ2
DOA
DOI 10.1515/jisys-2022-0228
DatabaseName CrossRef
ProQuest Computer Science Collection
Directory of Open Access Journals
DatabaseTitle CrossRef
ProQuest Computer Science Collection
DatabaseTitleList
CrossRef

ProQuest Computer Science Collection
Database_xml – sequence: 1
  dbid: DOA
  name: Directory of Open Access Journals
  url: http://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 2191-026X
EndPage 610
ExternalDocumentID oai_doaj_org_article_dbc96965d193469399ec3ec44a800ba2
10_1515_jisys_2022_0228
10_1515_jisys_2022_0228321
GroupedDBID 0R~
0~D
4.4
7WY
AAEMA
AAFPC
AAFWJ
AAGVJ
AAPJK
AAQCX
AASOL
AASQH
AAXCG
ABAOT
ABAQN
ABFKT
ABIQR
ABSOE
ABUVI
ABXMZ
ABYKJ
ACEFL
ACGFS
ACTFP
ACZBO
ADGQD
ADGYE
ADJVZ
ADOZN
AEJTT
AEQDQ
AERZL
AEXIE
AFBAA
AFCXV
AFPKN
AFQUK
AHGBP
AHGSO
AIERV
AIGSN
AJATJ
ALMA_UNASSIGNED_HOLDINGS
ARCSS
BAKPI
BBCWN
BCIFA
CFGNV
DBYYV
EBS
GROUPED_DOAJ
HZ~
IY9
M0C
O9-
OK1
P2P
QD8
RDG
SA.
AAYXX
AKXKS
CITATION
M48
SLJYH
JQ2
ID FETCH-LOGICAL-c427t-2ad3406e40d8a9ae7a84f1e29aea24455d29b87a59523ea66d9493a6a1955d553
IEDL.DBID DOA
ISSN 2191-026X
0334-1860
IngestDate Tue Oct 22 15:12:49 EDT 2024
Thu Oct 10 18:02:45 EDT 2024
Fri Aug 23 00:35:34 EDT 2024
Thu Mar 16 03:15:35 EDT 2023
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License This work is licensed under the Creative Commons Attribution 4.0 International License.
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c427t-2ad3406e40d8a9ae7a84f1e29aea24455d29b87a59523ea66d9493a6a1955d553
OpenAccessLink https://doaj.org/article/dbc96965d193469399ec3ec44a800ba2
PQID 2776962946
PQPubID 2031329
PageCount 11
ParticipantIDs doaj_primary_oai_doaj_org_article_dbc96965d193469399ec3ec44a800ba2
proquest_journals_2776962946
crossref_primary_10_1515_jisys_2022_0228
walterdegruyter_journals_10_1515_jisys_2022_0228321
PublicationCentury 2000
PublicationDate 2023-02-16
PublicationDateYYYYMMDD 2023-02-16
PublicationDate_xml – month: 02
  year: 2023
  text: 2023-02-16
  day: 16
PublicationDecade 2020
PublicationPlace Berlin
PublicationPlace_xml – name: Berlin
PublicationTitle Journal of intelligent systems
PublicationYear 2023
Publisher De Gruyter
Walter de Gruyter GmbH
Publisher_xml – name: De Gruyter
– name: Walter de Gruyter GmbH
References 2023031519363286491_j_jisys-2022-0228_ref_007
2023031519363286491_j_jisys-2022-0228_ref_008
2023031519363286491_j_jisys-2022-0228_ref_005
2023031519363286491_j_jisys-2022-0228_ref_027
2023031519363286491_j_jisys-2022-0228_ref_006
2023031519363286491_j_jisys-2022-0228_ref_003
2023031519363286491_j_jisys-2022-0228_ref_025
2023031519363286491_j_jisys-2022-0228_ref_004
2023031519363286491_j_jisys-2022-0228_ref_026
2023031519363286491_j_jisys-2022-0228_ref_001
2023031519363286491_j_jisys-2022-0228_ref_023
2023031519363286491_j_jisys-2022-0228_ref_002
2023031519363286491_j_jisys-2022-0228_ref_024
2023031519363286491_j_jisys-2022-0228_ref_021
2023031519363286491_j_jisys-2022-0228_ref_022
2023031519363286491_j_jisys-2022-0228_ref_020
2023031519363286491_j_jisys-2022-0228_ref_009
2023031519363286491_j_jisys-2022-0228_ref_018
2023031519363286491_j_jisys-2022-0228_ref_019
2023031519363286491_j_jisys-2022-0228_ref_016
2023031519363286491_j_jisys-2022-0228_ref_017
2023031519363286491_j_jisys-2022-0228_ref_014
2023031519363286491_j_jisys-2022-0228_ref_015
2023031519363286491_j_jisys-2022-0228_ref_012
2023031519363286491_j_jisys-2022-0228_ref_013
2023031519363286491_j_jisys-2022-0228_ref_010
2023031519363286491_j_jisys-2022-0228_ref_011
References_xml – ident: 2023031519363286491_j_jisys-2022-0228_ref_017
– ident: 2023031519363286491_j_jisys-2022-0228_ref_023
  doi: 10.1016/j.asoc.2018.06.040
– ident: 2023031519363286491_j_jisys-2022-0228_ref_022
  doi: 10.1007/s00521-017-2988-6
– ident: 2023031519363286491_j_jisys-2022-0228_ref_004
  doi: 10.1007/s00521-022-07203-7
– ident: 2023031519363286491_j_jisys-2022-0228_ref_006
  doi: 10.1016/j.swevo.2021.101022
– ident: 2023031519363286491_j_jisys-2022-0228_ref_001
  doi: 10.1109/CEC.2018.8477975
– ident: 2023031519363286491_j_jisys-2022-0228_ref_013
  doi: 10.1109/ACCESS.2021.3135805
– ident: 2023031519363286491_j_jisys-2022-0228_ref_016
  doi: 10.1007/s00521-018-3688-6
– ident: 2023031519363286491_j_jisys-2022-0228_ref_027
  doi: 10.1016/j.chemolab.2014.06.011
– ident: 2023031519363286491_j_jisys-2022-0228_ref_009
  doi: 10.1016/j.procs.2020.03.420
– ident: 2023031519363286491_j_jisys-2022-0228_ref_025
  doi: 10.1080/1062936X.2015.1040453
– ident: 2023031519363286491_j_jisys-2022-0228_ref_019
  doi: 10.1109/ACCESS.2019.2897325
– ident: 2023031519363286491_j_jisys-2022-0228_ref_024
  doi: 10.1016/j.compstruc.2016.03.001
– ident: 2023031519363286491_j_jisys-2022-0228_ref_002
  doi: 10.1515/jisys-2019-0062
– ident: 2023031519363286491_j_jisys-2022-0228_ref_010
  doi: 10.1109/JEEIT.2019.8717491
– ident: 2023031519363286491_j_jisys-2022-0228_ref_012
  doi: 10.1155/2022/5974634
– ident: 2023031519363286491_j_jisys-2022-0228_ref_015
  doi: 10.1007/s00500-019-03988-3
– ident: 2023031519363286491_j_jisys-2022-0228_ref_026
  doi: 10.1016/j.chemolab.2015.08.015
– ident: 2023031519363286491_j_jisys-2022-0228_ref_014
  doi: 10.1016/j.knosys.2021.107034
– ident: 2023031519363286491_j_jisys-2022-0228_ref_007
  doi: 10.1016/j.neucom.2015.06.083
– ident: 2023031519363286491_j_jisys-2022-0228_ref_021
  doi: 10.1016/j.eswa.2021.116431
– ident: 2023031519363286491_j_jisys-2022-0228_ref_008
  doi: 10.1007/978-981-10-8863-6_9
– ident: 2023031519363286491_j_jisys-2022-0228_ref_018
  doi: 10.1016/j.chemolab.2021.104288
– ident: 2023031519363286491_j_jisys-2022-0228_ref_003
  doi: 10.1016/j.mlwa.2021.100108
– ident: 2023031519363286491_j_jisys-2022-0228_ref_020
  doi: 10.1016/j.eswa.2020.114288
– ident: 2023031519363286491_j_jisys-2022-0228_ref_011
  doi: 10.1007/978-981-15-5281-6_34
– ident: 2023031519363286491_j_jisys-2022-0228_ref_005
SSID ssj0000491585
Score 2.3077462
Snippet The feature selection (FS) process has an essential effect in solving many problems such as prediction, regression, and classification to get the optimal...
Abstract The feature selection (FS) process has an essential effect in solving many problems such as prediction, regression, and classification to get the...
SourceID doaj
proquest
crossref
walterdegruyter
SourceType Open Website
Aggregation Database
Publisher
StartPage 1598
SubjectTerms Accuracy
Antiinfectives and antibacterials
binary crow search algorithm
Classification
Computational efficiency
Computing time
Datasets
Feature selection
Glycoproteins
Performance evaluation
quasi-oppositional method
Search algorithms
Title Improving binary crow search algorithm for feature selection
URI http://www.degruyter.com/doi/10.1515/jisys-2022-0228
https://www.proquest.com/docview/2776962946
https://doaj.org/article/dbc96965d193469399ec3ec44a800ba2
Volume 32
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://sdu.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV09T8MwFLSgE0v5FoWCPDCwRI1jO4klFj5adWIBJDbLsZ3SClrUpKr673l2kkKREAtblDiKdc_O3YudewhdmsiGxIow0IbrgOUxDwRPbZCoHOZfDgThlwuGj8nDS3rfdzY561Jfbk9YZQ9cAdczmXYGLtyA0oBUDvjUamo1YwqkTqaqt2-YfkumJpXuJSCEay8f4OzeZFysChgTkHs5y5cNGvJu_RsSs730i9XGjuaLVdksjnrOGeyhdi0W8U3VyX20ZacHaLcpxIDreXmIrtefBnDm_6_F8NQlrkYxVm-j2Xxcvr5jEKg4t97KExe-AA5E5Qg9D_pPd8OgLosQaBYlZRApQ4GGLQtN6ry1E5WynNgIDhWQNecmElmaKC4gybQqjo1ggqpYEQHXOKfHqDWdTe2J29dkdcx4qB3LE64zxanixoCoo9zkpIOuGpTkR-V-IV3WAIBKD6h0gEoHaAfdOhTXzZxttT8BwZR1MOVfweygbhMDWc8leESSwD2RYHEH0R9x-Wr1S7doRE7_o2dnaMcVmnf7tUncRa1yvrDnaLswiws_8j4BcZfc7g
link.rule.ids 315,782,786,866,2108,27935,27936
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Improving+binary+crow+search+algorithm+for+feature+selection&rft.jtitle=Journal+of+intelligent+systems&rft.au=Hamed+Alnaish%2C+Zakaria+A&rft.au=Zakariya+Yahya+Algamal&rft.date=2023-02-16&rft.pub=Walter+de+Gruyter+GmbH&rft.issn=0334-1860&rft.eissn=2191-026X&rft.issue=1&rft_id=info:doi/10.1515%2Fjisys-2022-0228&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2191-026X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2191-026X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2191-026X&client=summon