The Optimization of Feature Selection Based on Chaos Clustering Strategy and Niche Particle Swarm Optimization

Abstract EN

With the rapid increase of the data size, there are increasing demands for feature selection which has been a powerful tool to handle high-dimensional data.

In this paper, we propose a novel feature selection of niche particle swarm optimization based on the chaos group, which is used for evaluating the importance of feature selection algorithms.

An iterative algorithm is proposed to optimize the new model.

It has been proved that solving the new model is equivalent to solving a NP problem with a flexible and adaptable norm regularization.

First, the whole population is divided into two groups: NPSO group and chaos group.

The two groups are iterated, respectively, and the global optimization is updated.

Secondly, the cross-iteration of NPSO group and chaos group avoids the particles falling into the local optimization.

Finally, three representative algorithms are selected to be compared with each other in 10 UCI datasets.

The experimental results show that the feature selection performance of the algorithm is better than that of the comparison algorithm, and the classification accuracy is significantly improved.