ArticleBiomimetics (Basel, Switzerland)2025
A Novel Elite-Guided Hybrid Metaheuristic Algorithm for Efficient Feature Selection.
Article in Biomimetics (Basel, Switzerland), 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.
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
5 citing papers in PubMed.
- Hyperspectral Image Classification Based on an Improved Octopus Optimization Algorithm.Biomimetics (Basel, Switzerland) · 2026Article
- High-Dimensional Small-Sample Feature Selection Using Co-Evolutionary Ant Colony Optimization Inspired by Heterosis.Biomimetics (Basel, Switzerland) · 2026Article
- A multi-strategy enhanced RIME-based metaheuristic with adaptive strategy collaboration for global optimization and art image segmentation.Scientific reports · 2026Article
- TMPA-HC: a two-stage heterogeneous multi-population algorithm with cooperative search for high-dimensional feature selection.Scientific reports · 2026Article
- Multi-Threshold Image Segmentation Based on the Hybrid Strategy Improved Dingo Optimization Algorithm.Biomimetics (Basel, Switzerland) · 2026Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Feature selection aims to identify a relevant subset of features from the original feature set to enhance the performance of machine learning models, which is crucial for improvig model accuracy. However, this task is highly challenging due to the enormous search space, often requiring the use of meta-heuristic algorithms to efficiently identify near-optimal feature subsets. This paper proposes an improved algorithm based on Northern Goshawk Optimization (NGO), called Elite-guided Hybrid Northern Goshawk Optimization (EH-NGO), for feature selection tasks. The algorithm incorporates an elite-guided strategy within the NGO framework, leveraging information from elite individuals to direct the population's evolutionary trajectory. To further enhance population diversity and prevent premature convergence, a vertical crossover mutation strategy is adopted, which randomly selects two different dimensions of an individual for arithmetic crossover to generate new solutions, thereby improving the algorithm's global exploration capability. Additionally, a boundary control strategy based on the global best solution is introduced to reduce ineffective searches and accelerate convergence. Experiments conducted on 30 benchmark functions from the CEC2017 and CEC2022 test set demonstrate the superiority of EH-NGO in global optimization, outperforming eight compared state-of-the-art algorithms. Furthermore, a novel feature selection method based on EH-NGO is proposed and validated on 22 datasets of varying scales. Experimental results show that the proposed method can effectively select feature subsets that contribute to improved classification performance.
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.