Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 201

The DOI matches its Crossref record.

Asynchronous accelerating multi-leader salp chains for feature selection

Open access
Aljarah, Ibrahim, Mafarja, Majdi, Heidari, Ali Asghar, Faris, Hossam, Zhang, Yong, Mirjalili, Seyedali · 2018 · Applied Soft Computing

Abstract

Abstract Feature selection is an imperative preprocessing step that can positively affect the performance of machine learning techniques. Searching for the optimal feature subset amongst an unabridged dataset is a challenging problem, especially for large-scale datasets. In this research, a binary Salp Swarm Algorithm (SSA) with asynchronous updating rules and a new leadership structure is proposed. To set the best leadership structure, several extensive experiments are performed to determine the most effective number of leaders in the social organization of the artificial salp chain. Inspired from the behavior of a termite colony (TC) in dividing the termites into four types, the salp chain is then divided into several sub-chains, where the salps in each sub-chain can follow a different strategy to adaptively update their locations. Three different updating strategies are employed in this paper. The proposed algorithm is tested and validated on 20 well-known datasets from the UCI repository. The results and comparisons verify that utilizing half of the salps as leaders of the chain can significantly improve the performance of SSA in terms of accuracy metric. Furthermore, dynamically tuning the single parameter of algorithm enable it to more effectively explore the search space in dealing with different feature selection datasets.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.asoc.2018.07.040

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 201

Metadata

Authors
Aljarah, I., Mafarja, M., Heidari, A. A., Faris, H., Zhang, Y., & Mirjalili, S.
Venue
Applied Soft Computing
Publisher
Elsevier BV
Published
2018-10
Volume
71
Pages
964-979
ISSN
1568-4946 (ISSN-L)
OpenAlex
W2883013658
Cited by
201
References
0
FWCI
18.25
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Asynchronous accelerating multi-leader salp chains for feature selection. https://app.cochat.ai/papers/10.1016/j.asoc.2018.07.040
The paper
Aljarah, I., Mafarja, M., Heidari, A. A., Faris, H., Zhang, Y., & Mirjalili, S. (2018). Asynchronous accelerating multi-leader salp chains for feature selection. Applied Soft Computing. https://doi.org/10.1016/j.asoc.2018.07.040

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.