Evidence map›Paper›PMID 41379849›Full record

ArticlePloS one2025

A multiple filter-wrapper feature selection algorithm based on process optimization mechanism for high-dimensional omics data analysis.

Yongtao Shi, Yuefeng Zheng, Xiaotong Bai

Abstract read
In one paragraph

Article in PloS one, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Yongtao ShiSchool of Mathematics and Computer, Jilin Normal University, Siping, Jilin, China.ORCID https://orcid.org/0009-0009-1744-4445
Yuefeng ZhengSchool of Mathematics and Computer, Jilin Normal University, Siping, Jilin, China.ORCID https://orcid.org/0000-0002-5764-6887
Xiaotong BaiSchool of Mathematics and Computer, Jilin Normal University, Siping, Jilin, China.ORCID https://orcid.org/0009-0000-5738-1797

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Recently, hybrid feature selection methods have demonstrated excellent performance on high-dimensional data, but many of these methods tend to yield relatively homogeneous feature subsets. To address this, we propose a novel hybrid feature selection algorithm called the Hybrid Multiple Filter-Wrapper algorithm. This algorithm employs a dual-module structure: Module 1 utilizes the random forest feature importance method to achieve significant dimensionality reduction of the original feature set, resulting in the candidate feature subset F1. In Module 2, we first propose a bivariate filter algorithm: the minimum Spearman-Maximum Mutual Information method. This method assesses both the correlation and redundancy of F1, whose results are then fed into the wrapper algorithm for further exploration. Furthermore, we integrate two swarm intelligence algorithms to develop the Hybrid Grey Wolf and Chaotic Dung Beetle Wrapper Algorithm. This algorithm incorporates chaos theory to enhance the position update mechanism of the Dung Beetle Algorithm, then embeds Dung Beetle Algorithm into the Grey Wolf Algorithm, thereby balancing exploration and exploitation capabilities. Finally, a process optimization mechanism based on the theory of random laser intensity fluctuations dynamically monitors the optimization process. Upon convergence of the wrapper algorithm to a local optimum, the filter algorithm is restarted, and chaos theory is used to reset the population. This process enhances the diversity of both the candidate feature subset and the population, effectively avoiding local optima. We extensively compare our method with ten hybrid algorithms from the past three years across ten public benchmark datasets from MGE. Experimental results show that our algorithm outperforms the most other algorithms: on all datasets, it achieves an average classification accuracy that is at 1.3% least higher, an average feature subset length that is at least 8 units shorter, and a dimensionality reduced to less than 0.45% of the original. The results are statistically significant.

Indexed as

AlgorithmsComputational BiologyData AnalysisAnimalsColeoptera

Identifiers

PMID41379849
PMCPMC12697971

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

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.