AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (543.8 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Article | Open Access

Optimizing Feature Selection by Enhancing Particle Swarm Optimization with Orthogonal Initialization and Crossover Operator

Indu Bala( ), Wathsala Karunarathne, Lewis Mitchell
School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, SA 5005, Australia
Show Author Information

Abstract

Recent advancements in computational and database technologies have led to the exponential growth of large-scale medical datasets, significantly increasing data complexity and dimensionality in medical diagnostics. Efficient feature selection methods are critical for improving diagnostic accuracy, reducing computational costs, and enhancing the interpretability of predictive models. Particle Swarm Optimization (PSO), a widely used metaheuristic inspired by swarm intelligence, has shown considerable promise in feature selection tasks. However, conventional PSO often suffers from premature convergence and limited exploration capabilities, particularly in high-dimensional spaces. To overcome these limitations, this study proposes an enhanced PSO framework incorporating Orthogonal Initialization and a Crossover Operator (OrPSOC). Orthogonal Initialization ensures a diverse and uniformly distributed initial particle population, substantially improving the algorithm’s exploration capability. The Crossover Operator, inspired by genetic algorithms, introduces additional diversity during the search process, effectively mitigating premature convergence and enhancing global search performance. The effectiveness of OrPSOC was rigorously evaluated on three benchmark medical datasets—Colon, Leukemia, and Prostate Tumor. Comparative analyses were conducted against traditional filter-based methods, including Fast Clustering-Based Feature Selection Technique (Fast-C), Minimum Redundancy Maximum Relevance (MinRedMaxRel), and Five-Way Joint Mutual Information (FJMI), as well as prominent metaheuristic algorithms such as standard PSO, Ant Colony Optimization (ACO), Comprehensive Learning Gravitational Search Algorithm (CLGSA), and Fuzzy-Based CLGSA (FCLGSA). Experimental results demonstrated that OrPSOC consistently outperformed these existing methods in terms of classification accuracy, computational efficiency, and result stability, achieving significant improvements even with fewer selected features. Additionally, a sensitivity analysis of the crossover parameter provided valuable insights into parameter tuning and its impact on model performance. These findings highlight the superiority and robustness of the proposed OrPSOC approach for feature selection in medical diagnostic applications and underscore its potential for broader adoption in various high-dimensional, data-driven fields.

References

【1】
【1】
 
 
Computers, Materials & Continua
Pages 727-744

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Bala I, Karunarathne W, Mitchell L. Optimizing Feature Selection by Enhancing Particle Swarm Optimization with Orthogonal Initialization and Crossover Operator. Computers, Materials & Continua, 2025, 84(1): 727-744. https://doi.org/10.32604/cmc.2025.065706

1691

Views

70

Downloads

7

Crossref

8

Web of Science

10

Scopus

Received: 20 March 2025
Accepted: 15 May 2025
Published: 09 June 2025
© The Author 2024.

This work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.