Performance improvement of particle swarm optimization for high-dimensional function optimization

2007 ◽  
Author(s):  
Takeshi Korenaga ◽  
Toshiharu Hatanaka ◽  
Katsuji Uosaki
Keyword(s):  
Particle Swarm Optimization ◽  
Performance Improvement ◽  
Particle Swarm ◽  
Function Optimization ◽  
High Dimensional ◽  
Swarm Optimization

scholarly journals Global Particle Swarm Optimization for High Dimension Numerical Functions Analysis

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
J. J. Jamian ◽  
M. N. Abdullah ◽  
H. Mokhlis ◽  
M. W. Mustafa ◽  
A. H. A. Bakar
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Function Optimization ◽  
High Dimensional ◽  
Local Optimum ◽  
Mathematical Function ◽  
Numerical Function ◽  
Swarm Optimization ◽  
Particle Position

The Particle Swarm Optimization (PSO) Algorithm is a popular optimization method that is widely used in various applications, due to its simplicity and capability in obtaining optimal results. However, ordinary PSOs may be trapped in the local optimal point, especially in high dimensional problems. To overcome this problem, an efficient Global Particle Swarm Optimization (GPSO) algorithm is proposed in this paper, based on a new updated strategy of the particle position. This is done through sharing information of particle position between the dimensions (variables) at any iteration. The strategy can enhance the exploration capability of the GPSO algorithm to determine the optimum global solution and avoid traps at the local optimum. The proposed GPSO algorithm is validated on a 12-benchmark mathematical function and compared with three different types of PSO techniques. The performance of this algorithm is measured based on the solutions’ quality, convergence characteristics, and their robustness after 50 trials. The simulation results showed that the new updated strategy in GPSO assists in realizing a better optimum solution with the smallest standard deviation value compared to other techniques. It can be concluded that the proposed GPSO method is a superior technique for solving high dimensional numerical function optimization problems.

Improved Particle Swarm Optimization Algorithm and its Application Based on the Aggregation Degree

2013 ◽  
Vol 427-429 ◽  
pp. 1934-1938
Author(s):  
Zhong Rong Zhang ◽  
Jin Peng Liu ◽  
Ke De Fei ◽  
Zhao Shan Niu
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Population Diversity ◽  
Function Optimization ◽  
Local Optimum ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization

The aim is to improve the convergence of the algorithm, and increase the population diversity. Adaptively particles of groups fallen into local optimum is adjusted in order to realize global optimal. by judging groups spatial location of concentration and fitness variance. At the same time, the global factors are adjusted dynamically with the action of the current particle fitness. Four typical function optimization problems are drawn into simulation experiment. The results show that the improved particle swarm optimization algorithm is convergent, robust and accurate.

A hybrid feature selection algorithm combining ReliefF and Particle swarm optimization for high-dimensional medical data

2021 ◽  
pp. 1-15
Author(s):  
Zhaozhao Xu ◽  
Derong Shen ◽  
Yue Kou ◽  
Tiezheng Nie
Keyword(s):  
Feature Selection ◽  
Particle Swarm Optimization ◽  
Random Forest ◽  
Classification Accuracy ◽  
Particle Swarm ◽  
Medical Data ◽  
High Dimensional ◽  
Selection Algorithm ◽  
Feature Selection Algorithm ◽  
Swarm Optimization

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.

Sign in / Sign up

Export Citation Format

Share Document