Overall, VL-APSO-LS provides a robust, adaptive, and statistically validated optimisation framework for high-dimensional biomedical classification and achieves perfect classification accuracy on the Leukaemia dataset.
Abstract
High-dimensional gene expression data pose substantial challenges for cancer classification due to extreme dimensionality, feature redundancy, and limited sample availability. Conventional Variable-Length PSO with Local Search (VLPSO-LS) relies on static acceleration coefficients and predefined inertia-weight schedules, which may limit adaptive search behaviour and increase the risk of premature convergence. To address these limitations, this study proposes a novel Variable-Length Adaptive Particle Swarm Optimisation with Local Search (VL-APSO-LS) framework. The proposed method incorporates a dynamic particle representation, adaptive inertia weight and acceleration control, and a comprehensive velocity update mechanism to enhance diversification and exploitation within a variable-length optimisation structure. The framework was evaluated on five benchmark microarray datasets (Leukaemia, SRBCT, Colon, Lymphoma, and Lung cancer) using four widely adopted classifiers. Experimental results demonstrate that VL-APSO-LS consistently improves predictive performance and feature-selection efficiency relative to VLPSO-LS and other PSO-based variants. The strong-balance performance configuration (Scheme 2) achieves an average classification accuracy of 94.39%, outperforming the baseline of 92.64%. Furthermore, it achieves the highest Accuracy-to-Feature Ratio (0.3775 vs 0.3369), indicating a superior balance between accuracy and feature compactness. Notably, the proposed method achieves perfect classification accuracy (100%) on the Leukaemia dataset and reduces the selected features in the Colon dataset to only 86, compared with over 700 features in competing approaches. Statistical validation confirms consistent non-inferiority and frequent superiority across dataset-classifier combinations, particularly when integrated with Support Vector Machine (SVM). Overall, VL-APSO-LS provides a robust, adaptive, and statistically validated optimisation framework for high-dimensional biomedical classification.
MASA-PSO adopts a multiscale-adaptive weighting framework to explore feature subsets that distinguish between-class sample distributions during search spaces changes, and theoretically proves it enables the collaborative evaluation of multiple metrics.
Wei-Hao Deng, Ling-Yun Zhao, Fei Han· Proceedings of the Thirty-Fi...· 0 citations
In cancer genomics research, feature selection (FS) of high‐dimensional gene expression data is of great significance to improve classification accuracy and reduce feature number. Aiming at the limitations of traditional transfer functions, such as nonadaptability and being prone to fall into local optimum when deali...
Yu-Cai Wang, Shi Li, Jie-Sheng Wang et al.· International Conference on...· 0 citations
Traditional particle swarm optimization (PSO) easily falls into premature convergence, while differential evolution (DE) is highly sensitive to fixed control parameters. Existing PSO-DE hybrid frameworks suffer from static population sizes and insufficient cross-population information exchange. This paper proposes PSO-...
Yao-Pei Wang, Yufeng Wang, Ke Liu· Algorithms· 0 citations
Face recognition (FR) is one of the fundamental challenge faced in computer vision with it’s applications spanning from security, surveillance to human–computer interaction. The high dimensionality of facial feature spaces extracted via Principal Component Analysis (PCA) introduces the curse of dimensionality, motivati...
Suraj Roy, A. K. Saha, Sharmistha Bhattacharya Halder· International Workshop on Ar...· 0 citations
A multi-tree and multi-strategy iterative genetic programming algorithm is proposed for feature subset construction and classification that attains higher average balanced classification accuracy than all baselines on nine datasets and surpasses them in macro F1-score on ten datasets.
Chen Zhang, Ze-Zhong Zhang, You-Ping Tu et al.· Applied intelligence (Boston...· 0 citations
A hybrid GA that integrates an information-theoretic local search strategy for unsupervised FS and effectively mitigates the premature convergence problem of conventional GAs and improves search efficiency and solution quality compared to traditional heuristic and evolutionary approaches is proposed.
Seyeon Son, Hyunki Lim· Computers, Materials & C...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.