ArticleEntropy (Basel, Switzerland)2026
A Feature Selection Method Based on an Improved Sand Cat Swarm Optimization Algorithm with Multi-Strategy Fusion.
Article in Entropy (Basel, Switzerland), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
6 authors.
Funding
Abstract
Feature selection (FS) plays a crucial role in high-dimensional data analysis by improving model performance and reducing computational complexity. However, existing metaheuristic-based FS methods often suffer from insufficient population diversity, premature convergence, and limited capability to escape local optima, which substantially constrains their effectiveness in complex search spaces. To address these challenges, this paper proposes a novel Improved Sand Cat Swarm Optimization algorithm with multi-strategy fusion (ISCSO) for feature selection. The proposed method introduces a hybrid initialization mechanism based on the Hénon chaotic map and lens imaging reverse learning to enhance population diversity. A golden sine-based phase adjustment strategy is further incorporated to achieve a more effective balance between global exploration and local exploitation. In addition, a nonlinear adaptive weight mechanism is designed to dynamically regulate the search process, while a simulated annealing-based acceptance criterion is integrated to improve the ability to escape local optima. Comprehensive experiments are conducted on the CEC2017 benchmark suite and 18 real-world datasets from the UCI repository. The results demonstrate that ISCSO achieves superior performance over state-of-the-art algorithms, obtaining the optimal results on 82.76% of benchmark functions. In feature selection tasks, ISCSO achieves the optimal average fitness on 94.44% of datasets, reduces feature dimensionality significantly, and consistently improves classification accuracy. These findings indicate that ISCSO provides a competitive and reliable solution for high-dimensional feature selection and complex optimization problems.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.