Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

Cuckoo algorithm with great deluge local-search for feature selection problems

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 12 No. 4 (2022)

DOI
10.11591/ijece.v12i4.pp4315-4326
ISSN
2722-2578, 2088-8708
Published
2022-08-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

Feature selection problem is concerned with searching in a dataset for a set of features aiming to reduce the training time and enhance the accuracy of a classification method. Therefore, feature selection algorithms are proposed to choose important features from large and complex datasets. The cuckoo search (CS) algorithm is a type of natural-inspired optimization algorithms and is widely implemented to find the optimum solution for a specified problem. In this work, the cuckoo search algorithm is hybridized with a local search algorithm to find a satisfactory solution for the problem of feature selection. The great deluge (GD) algorithm is an iterative search procedure, that can accept some worse moves to find better solutions for the problem, also to increase the exploitation ability of CS. The comparison is also provided to examine the performance of the proposed method and the original CS algorithm. As result, using the UCI datasets the proposed algorithm outperforms the original algorithm and produces comparable results compared with some of the results from the literature.

Collaboration network of the authors

40 authors · 216 co-authorship links · 75 across different organisations · showing the 40 most connected

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Imam Abdulrahman Bin Faisal University
  • Al-Balqa Applied University
  • Taibah University
  • Amman Arab University
  • Fujairah University
  • Wenzhou-Kean University
  • King Hussein Cancer Center
  • Other organisations
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Ghaith M. JaradatAmman Arab University15
Eman A. E. AhmedImam Abdulrahman Bin Faisal University14
Ibrahim AlmarashdehImam Abdulrahman Bin Faisal University12
Usama A. BadawiImam Abdulrahman Bin Faisal University12
Hayat AlfaghamImam Abdulrahman Bin Faisal University12
Jehad Saad AlqurniImam Abdulrahman Bin Faisal University11
Rami Mustafa A. MohammadImam Abdulrahman Bin Faisal University9
Firas HaddadImam Abdulrahman Bin Faisal University6
Raed Ali AlkhasawnehImam Abdulrahman Bin Faisal University4
Mohammed Fahed TayfourImam Abdulrahman Bin Faisal University3
Yousef QawqzehFujairah University3
Abderrazak Ben SalahImam Abdulrahman Bin Faisal University3
Mohammad AlmatariAl-Balqa Applied University3
Belal AbuhaijaWenzhou-Kean University3
Aladeen AlloubaniKing Hussein Cancer Center3
Muneerah AlshabanahImam Abdulrahman Bin Faisal University2
Daniah AlrajhiImam Abdulrahman Bin Faisal University2
Hanouf AlkhaldiImam Abdulrahman Bin Faisal University2
Tamer FaragImam Abdulrahman Bin Faisal University2
Walaa HassanImam Abdulrahman Bin Faisal University2
Anmar AbuhamdahTaibah University2
Ahmad Mohamad Al-SmadiAl-Balqa Applied University1
Abdel Karim BaarehAl-Balqa Applied University1
Hayam AbouelmagdImam Abdulrahman Bin Faisal University1
Osman Saad ShidwanImam Abdulrahman Bin Faisal University1
Ali Al‐YousefJerash University1
Anmar Abu-HamdahAffiliation unknown1
Khalid ShakerUniversity of Anbar1
Wadii BoulilaTaibah University1
Anas Mohammad Ali QuteishatAl-Balqa Applied University1
Ahmed Mohamed Farhan MohamedImam Abdulrahman Bin Faisal University1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Cuckoo algorithm with great deluge local-search for feature selection problems</dc:title><dc:creator>Khalil Alsmadi, Mutasem</dc:creator><dc:creator>Alzaqebah, Malek</dc:creator><dc:creator>Jawarneh, Sana</dc:creator><dc:creator>Brini, Sami</dc:creator><dc:creator>Al-Marashdeh, Ibrahim</dc:creator><dc:creator>Briki, Khaoula</dc:creator><dc:creator>Alrefai, Nashat</dc:creator><dc:creator>Ali Alghamdi, Fahad</dc:creator><dc:creator>Al-Rashdan, Maen T.</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;p class="Abstract"&amp;gt;&amp;lt;span lang="EN-US"&amp;gt;Feature selection problem is concerned with searching in a dataset for a set of features aiming to reduce the training time and enhance the accuracy of a classification method. Therefore, feature selection algorithms are proposed to choose important features from large and complex datasets. The cuckoo search (CS) algorithm is a type of natural-inspired optimization algorithms and is widely implemented to find the optimum solution for a specified problem. In this work, the cuckoo search algorithm is hybridized with a local search algorithm to find a satisfactory solution for the problem of feature selection. The great deluge (GD) algorithm is an iterative search procedure, that can accept some worse moves to find better solutions for the problem, also to increase the exploitation ability of CS. The comparison is also provided to examine the performance of the proposed method and the original CS algorithm. As result, using the UCI datasets the proposed algorithm outperforms the original algorithm and produces comparable results compared with some of the results from the literature.&amp;lt;/span&amp;gt;&amp;lt;/p&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2022-08-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v12i4.pp4315-4326</dc:identifier><dc:identifier>10.11591/ijece.v12i4.pp4315-4326</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 12 No 4 (2022); 4315</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/26800/15839</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>