Chaotic PSO with Mutation for Classification

Zahra Assarzadeh, Ahmad Reza Naghsh Nilchi



In this paper, a chaotic particle swarm optimization with mutation-based classifier particle swarm optimization is proposed to classifypatterns of different classes in the feature space. The introduced mutation operators and chaotic sequences allows us to overcomethe problem of early convergence into a local minima associated with particle swarm optimization algorithms. That is, the mutationoperator sharpens the convergence and it tunes the best possible solution. Furthermore, to remove the irrelevant data and reduce thedimensionality of medical datasets, a feature selection approach using binary version of the proposed particle swarm optimization  isintroduced. In order to demonstrate the effectiveness of our proposed classifier, mutation-based  classifier particle swarm optimization,it is checked out with three sets of data classifications namely, Wisconsin diagnostic breast cancer, Wisconsin breast cancer and heartstatlog,
with different feature vector dimensions. The proposed algorithm is compared with different classifier algorithms includingk-nearest neighbor, as a conventional classifier, particle swarm-classifier, genetic algorithm, and Imperialist competitive algorithmclassifier,
as more sophisticated ones. The performance of each classifier was evaluated by calculating the accuracy, sensitivity,specificity and Matthews’s correlation coefficient. The experimental results show that the mutation-based  classifier particle swarmptimization unequivocally performs better than all the compared algorithms.


Decision hyperplanes; Particle swarm optimization; Pattern recognition; Swarm intelligence algorithms

Full Text:



  • There are currently no refbacks.