Evidence map›Paper›PMID 40567808›Full record

ArticlePeerJ. Computer science2025

Gene selection based on adaptive neighborhood-preserving multi-objective particle swarm optimization.

Sumet Mehta, Fei Han, Muhammad Sohail, Bhekisipho Twala, Asad Ullah, Fasee Ullah, Arfat Ahmad Khan, Qinghua Ling

Abstract read
In one paragraph

Article in PeerJ. Computer science, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing 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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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

8 authors.

Sumet MehtaSchool of Computer Science & Communication Engineering, Jiangsu University, Zhenjiang, Jiangsu, China.ORCID 0000-0002-7928-8662
Fei HanSchool of Computer Science & Communication Engineering, Jiangsu University, Zhenjiang, Jiangsu, China.
Muhammad SohailDepartment of Computer Software Engineering, Military College of Signals, NUST, Islamabad, Islamabad, Pakistan.ORCID 0000-0002-7234-8108
Bhekisipho TwalaFaculty of Information and Communication Technology, Tshwane University of Technology, Pretoria West, Pretoria, South Africa.ORCID 0000-0002-3452-9581
Asad UllahDepartment of Computer Software Engineering, Military College of Signals, NUST, Islamabad, Islamabad, Pakistan.
Fasee UllahThe Department of Computing, Universiti Teknologi PETRONAS, Seri Iskandar, Perak Darul Ridzuan, Malaysia.
Arfat Ahmad KhanDepartment of Computer Science, College of Computing, Khon Kaen University, Khon Kaen, Khon Kaen, Thailand.
Qinghua LingSchool of Computer Science and Engineering, Jiangsu University of Science & Technology, Zhenjiang, Jiangsu, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The analysis of high-dimensional microarray gene expression data presents critical challenges, including excessive dimensionality, increased computational burden, and sensitivity to random initialization. Traditional optimization algorithms often produce inconsistent and suboptimal results, while failing to preserve local data structures limiting both predictive accuracy and biological interpretability. To address these limitations, this study proposes an adaptive neighborhood-preserving multi-objective particle swarm optimization (ANPMOPSO) framework for gene selection. ANPMOPSO introduces four key innovations: (1) a weighted neighborhood-preserving ensemble embedding (WNPEE) technique for dimensionality reduction that retains local structure; (2) Sobol sequence (SS) initialization to enhance population diversity and convergence stability; (3) a differential evolution (DE)-based adaptive velocity update to dynamically balance exploration and exploitation; and (4) a novel ranking strategy that combines Pareto dominance with neighborhood preservation quality to prioritize biologically meaningful gene subsets. Experimental evaluations on six benchmark microarray datasets and eleven multi-modal test functions (MMFs) demonstrate that ANPMOPSO consistently outperforms state-of-the-art methods. For example, it achieves 100% classification accuracy on Leukemia and Small-Round-Blue-Cell Tumor (SRBCT) using only 3-5 genes, improving accuracy by 5-15% over competitors while reducing gene subsets by 40-60%. Additionally, on MMFs, ANPMOPSO attains superior hypervolume values (

Indexed as

Microarray gene selectionMulti-objective optimizationNeighborhood preservationParticle swarm optimization

Identifiers

PMID40567808
PMCPMC12192825

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.