Related Experiment Video
Updated: Jan 16, 2026

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
Published on: October 11, 2018
Quantum-Inspired gravitationally guided particle swarm optimization for feature selection and classification
Saleem Malik1, S Gopal Krishna Patro2, Chandrakanta Mahanty3
1CSE Department, P A College of Engineering, 574153, Coimbatore, India. baronsaleem@gmail.com.
Abstract:
Population-based metaheuristic optimization algorithms have gained prominence for tackling complex optimization problems. They balance exploration and exploitation, essential for finding optimal solutions. While algorithms like Genetic Algorithms, Particle Swarm Optimization, and Gravitational Search Algorithm have shown success, they have limitations, such as premature convergence and sensitivity to parameters. To address these issues, we have introduced Quantum-Inspired Gravitationally Guided Particle Swarm Optimization (QIGPSO) for addressing complex optimization challenges, particularly in the context of medical data analysis for diagnosing Non-Communicable Diseases (NCDs). The Quantum Particle Swarm Optimization (QPSO) and Gravitational Search Algorithm (GSA) are both used in QIGPSO. It takes advantage of each algorithm's strengths in both global and local search processes. We used an absolute Gaussian random variable to improve the search, changed the position update equations and used a wrapper-based method with Support Vector Machine (SVM) for feature selection and classification. The findings suggest that QIGPSO is effective at identifying key features, achieving high accuracy rates, and lowering the number of incorrect classifications across several NCD datasets. Doctors can use QIGPSO data to make better treatment decisions for their patients. QIGPSO overcomes the limitations of conventional optimization methods by faster convergence while improving exploitation balance.
Related Concept Videos
Classification of Systems-I
Homogeneity dictates that if an input x(t) is multiplied by a constant c, the output y(t) is multiplied by the same constant. Mathematically, this is expressed as:
Quantifying and Rejecting Outliers: The Grubbs Test
Classification of Systems-II
Classification of Signals
A continuous-time signal holds a value at every instant in time, representing information seamlessly. In contrast, a discrete-time signal holds values only at specific moments, often denoted as x(n), where...
Cluster Sampling Method
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
Maxwell-Boltzmann Distribution: Problem Solving
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
