Improvement of Particle Swarm Optimization for High-Dimensional Space

Author(s):  
Takeshi Korenaga ◽  
Toshiharu Hatanaka ◽  
Katsuji Uosaki
Author(s):  
RUOCHEN LIU ◽  
PING ZHANG ◽  
LICHENG JIAO

Data processing in high-dimensional spaces is a challenging task. In order to effectively classify the data in a high-dimensional space, a quantum particle swarm optimization classification algorithm (QPSOCA) for high-dimensional datasets is proposed in this paper. In QPSOCA, an uncorrelated discriminant analysis algorithm is utilized to reduce the dimension of the data, which is implemented automatically and no extra parameters are needed. In addition, to avoid the randomness of the swarm and improve the convergence speed, quantum computation is introduced into particle swarm optimization (PSO). In the experimental section, a detailed comparison of three different combinatorial optimization methods is given to demonstrate the efficiency of the proposed algorithm. Comparative experiments show that the proposed algorithm can improve the classification accuracy.


2021 ◽  
pp. 1-15
Author(s):  
Zhaozhao Xu ◽  
Derong Shen ◽  
Yue Kou ◽  
Tiezheng Nie

Due to high-dimensional feature and strong correlation of features, the classification accuracy of medical data is not as good enough as expected. feature selection is a common algorithm to solve this problem, and selects effective features by reducing the dimensionality of high-dimensional data. However, traditional feature selection algorithms have the blindness of threshold setting and the search algorithms are liable to fall into a local optimal solution. Based on it, this paper proposes a hybrid feature selection algorithm combining ReliefF and Particle swarm optimization. The algorithm is mainly divided into three parts: Firstly, the ReliefF is used to calculate the feature weight, and the features are ranked by the weight. Then ranking feature is grouped according to the density equalization, where the density of features in each group is the same. Finally, the Particle Swarm Optimization algorithm is used to search the ranking feature groups, and the feature selection is performed according to a new fitness function. Experimental results show that the random forest has the highest classification accuracy on the features selected. More importantly, it has the least number of features. In addition, experimental results on 2 medical datasets show that the average accuracy of random forest reaches 90.20%, which proves that the hybrid algorithm has a certain application value.


2010 ◽  
Vol 20-23 ◽  
pp. 1280-1285
Author(s):  
Jian Xiang Wei ◽  
Yue Hong Sun

The particle swarm optimization (PSO) algorithm is a new population search strategy, which has exhibited good performance through well-known numerical test problems. However, it is easy to trap into local optimum because the population diversity becomes worse during the evolution. In order to overcome the shortcoming of the PSO, this paper proposes an improved PSO based on the symmetry distribution of the particle space position. From the research of particle movement in high dimensional space, we can see: the more symmetric of the particle distribution, the bigger probability can the algorithm be during converging to the global optimization solution. A novel population diversity function is put forward and an adjustment algorithm is put into the basic PSO. The steps of the proposed algorithm are given in detail. With two typical benchmark functions, the experimental results show the improved PSO has better convergence precision than the basic PSO.


Sign in / Sign up

Export Citation Format

Share Document