Clustering Algorithm Based on Improved Particle Swarm Algorithm

2013 ◽  
Vol 798-799 ◽  
pp. 689-692 ◽  
Author(s):  
Jin Hui Yang ◽  
Xi Cao
Keyword(s):  
Cluster Analysis ◽  
Particle Swarm Optimization ◽  
Local Search ◽  
Clustering Algorithm ◽  
Particle Swarm ◽  
Particle Swarm Algorithm ◽  
Swarm Optimization ◽  
Initial Cluster ◽  
Cluster Analysis Method ◽  
Swarm Algorithm

K-means algorithm is a traditional cluster analysis method, has the characteristics of simple ideas and algorithms, and thus become one of the commonly used methods of cluster analysis. However, the K-means algorithm classification results are too dependent on the choice of the initial cluster centers for some initial value, the algorithm may converge in general suboptimal solutions. Analysis of the K-means algorithm and particle swarm optimization based on a clustering algorithm based on improved particle swarm algorithm. The algorithm local search ability of the K-means algorithm and the global search ability of particle swarm optimization, local search ability to improve the K-means algorithm to accelerate the convergence speed effectively prevent the occurrence of the phenomenon of precocious puberty. The experiments show that the clustering algorithm has better convergence effect.

A Clustering Algorithm Based on Improved Particle Swarm Optimization

2014 ◽  
Vol 635-637 ◽  
pp. 1467-1470
Author(s):  
Xun Wang
Keyword(s):  
Cluster Analysis ◽  
Particle Swarm Optimization ◽  
Local Search ◽  
Clustering Algorithm ◽  
Particle Swarm ◽  
Particle Swarm Algorithm ◽  
Initial Value ◽  
Swarm Optimization ◽  
Initial Cluster ◽  
Cluster Analysis Method

K-means algorithm is a traditional cluster analysis method, has the characteristics of simple ideas and algorithms, and thus become one of the commonly used methods of cluster analysis. However, the K-means algorithm classification results are too dependent on the choice of the initial cluster centers for some initial value, the algorithm may converge in general suboptimal solutions. Analysis of the K-means algorithm and particle swarm optimization based on a clustering algorithm based on improved particle swarm algorithm. The algorithm local search ability of the K-means algorithm and the global search ability of particle swarm optimization, local search ability to improve the K-means algorithm to accelerate the convergence speed effectively prevent the occurrence of the phenomenon of precocious puberty. The experiments show that the clustering algorithm has better convergence effect.

A K-Medoids Clustering Algorithm Based on Particle Swarm Algorithm with Simulated Annealing

2013 ◽  
Vol 325-326 ◽  
pp. 1628-1631 ◽  
Author(s):  
Hong Zhou ◽  
Ke Luo
Keyword(s):  
Particle Swarm Optimization ◽  
Simulated Annealing ◽  
Optimization Algorithm ◽  
Clustering Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Particle Swarm Algorithm ◽  
Swarm Optimization ◽  
Optimal Value ◽  
Swarm Algorithm

Be aimed at the problems that K-medoids algorithm is easy to fall into the local optimal value and basic particle swarm algorithm is easy to fall into the premature convergence, this paper joins the Simulated Annealing (SA) thought and proposes a novel K-medoids clustering algorithm based on Particle swarm optimization algorithm with simulated annealing. The new algorithm combines the quick optimization ability of particle swarm optimization algorithm and the probability of jumping property with SA, and maintains the characteristics that particle swarm algorithm is easy to realize, and improves the ability of the algorithm from local extreme value point. The experimental results show that the algorithm enhances the convergence speed and accuracy of the algorithm, and the clustering effect is better than the original k-medoids algorithm.

Introduction of New Anti-dumping Algorithm in EU under WTO Law System Based on Particle Swarm Optimization

2021 ◽  
Vol 7 (5) ◽  
pp. 4558-4567
Author(s):  
Wenwen Deng
Keyword(s):  
Particle Swarm Optimization ◽  
Operation Mode ◽  
Particle Swarm ◽  
Algorithm Analysis ◽  
Particle Swarm Algorithm ◽  
Swarm Optimization ◽  
Law System ◽  
Incomplete System ◽  
Swarm Algorithm ◽  
The Eu

Objectives: Anti dumping new algorithm is an innovative ability based on the WTO legal system, which has made an important contribution to the economic development of the EU system. Methods: At present, the operation mode of new antidumping algorithm has some defects, such as structure confusion and incomplete system implementation, which affects the development progress of EU economic growth. Results: Based on the above problems, in this paper, particle swarm algorithm is introduced, based on the optimization analysis of the website structure of the new antidumping algorithm, through the independent screening analysis of particle swarm optimization, combining the WTO economy with the EU status theory, Conclusion: the paper obtains the optimized anti-dumping innovation scheme on the basis of particle swarm algorithm analysis, and finally passes the input test. The feasibility of the scheme is established.

scholarly journals Application of Strongly Constrained Space Particle Swarm Optimization to Optimal Operation of a Reservoir System

2018 ◽  
Vol 10 (12) ◽  
pp. 4445 ◽  
Author(s):  
Lejun Ma ◽  
Huan Wang ◽  
Baohong Lu ◽  
Changjun Qi
Keyword(s):  
Particle Swarm Optimization ◽  
Computational Efficiency ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Optimal Operation ◽  
Computational Time ◽  
Particle Swarm Algorithm ◽  
Swarm Optimization ◽  
Swarm Algorithm ◽  
Low Efficiency

In view of the low efficiency of the particle swarm algorithm under multiple constraints of reservoir optimal operation, this paper introduces a particle swarm algorithm based on strongly constrained space. In the process of particle optimization, the algorithm eliminates the infeasible region that violates the water balance in order to reduce the influence of the unfeasible region on the particle evolution. In order to verify the effectiveness of the algorithm, it is applied to the calculation of reservoir optimal operation. Finally, this method is compared with the calculation results of the dynamic programming (DP) and particle swarm optimization (PSO) algorithm. The results show that: (1) the average computational time of strongly constrained particle swarm optimization (SCPSO) can be thought of as the same as the PSO algorithm and lesser than the DP algorithm under similar optimal value; and (2) the SCPSO algorithm has good performance in terms of finding near-optimal solutions, computational efficiency, and stability of optimization results. SCPSO not only improves the efficiency of particle evolution, but also avoids excessive improvement and affects the computational efficiency of the algorithm, which provides a convenient way for particle swarm optimization in reservoir optimal operation.

scholarly journals Memetic Variable Clustering and Its Application

2019 ◽  
Vol 2019 ◽  
pp. 1-15
Author(s):  
JiaCheng Ni ◽  
Li Li
Keyword(s):  
Particle Swarm Optimization ◽  
Local Search ◽  
Clustering Analysis ◽  
Clustering Algorithm ◽  
Particle Swarm ◽  
Optimization Techniques ◽  
Experimental Result ◽  
Swarm Optimization ◽  
Metaheuristic Optimization ◽  
Variable Clustering

Clustering analysis is an important and difficult task in data mining and big data analysis. Although being a widely used clustering analysis technique, variable clustering did not get enough attention in previous studies. Inspired by the metaheuristic optimization techniques developed for clustering data items, we try to overcome the main shortcoming of k-means-based variable clustering algorithm, which is being sensitive to initial centroids by introducing the metaheuristic optimization. A novel memetic algorithm named MCLPSO (Memetic Comprehensive Learning Particle Swarm Optimization) based on CLPSO (Comprehensive Learning Particle Swarm Optimization) has been studied under the framework of memetic computing in our previous work. In this work, MCLPSO is used as a metaheuristic approach to improve the k-means-based variable clustering algorithm by adjusting the initial centroids iteratively to maximize the homogeneity of the clustering results. In MCLPSO, a chaotic local search operator is used and a simulated annealing- (SA-) based local search strategy is developed by combining the cognition-only PSO model with SA. The adaptive memetic strategy can enable the stagnant particles which cannot be improved by the comprehensive learning strategy to escape from the local optima and enable some elite particles to give fine-grained local search around the promising regions. The experimental result demonstrates a good performance of MCLPSO in optimizing the variable clustering criterion on several datasets compared with the original variable clustering method. Finally, for practical use, we also developed a web-based interactive software platform for the proposed approach and give a practical case study—analyzing the performance of semiconductor manufacturing system to demonstrate the usage.

A Novel Reactive Power Compensation Approach Based on Particle Swarm Optimization

2015 ◽  
Vol 740 ◽  
pp. 401-404
Author(s):  
Yun Zhi Li ◽  
Quan Yuan ◽  
Yang Zhao ◽  
Qian Hui Gang
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problem ◽  
Reactive Power ◽  
Power Optimization ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Particle Swarm Algorithm ◽  
Reactive Power Optimization ◽  
Swarm Optimization ◽  
Swarm Algorithm

The particle swarm optimization (PSO) algorithm as a stochastic search algorithm for solving reactive power optimization problem. The PSO algorithm converges too fast, easy access to local convergence, leading to convergence accuracy is not high, to study the particle swarm algorithm improvements. The establishment of a comprehensive consideration of the practical constraints and reactive power regulation means no power optimization mathematical model, a method using improved particle swarm algorithm for reactive power optimization problem, the algorithm weighting coefficients and inactive particles are two aspects to improve. Meanwhile segmented approach to particle swarm algorithm improved effectively address the shortcomings evolution into local optimum and search accuracy is poor, in order to determine the optimal reactive power optimization program.

scholarly journals A Simplified Recombinant PSO

2008 ◽  
Vol 2008 ◽  
pp. 1-10 ◽  
Author(s):  
Dan Bratton ◽  
Tim Blackwell
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Particle Swarm Algorithm ◽  
Swarm Optimization ◽  
Swarm Algorithm

Simplified forms of the particle swarm algorithm are very beneficial in contributing to understanding how a particle swarm optimization (PSO) swarm functions. One of these forms, PSO with discrete recombination, is extended and analyzed, demonstrating not just improvements in performance relative to a standard PSO algorithm, but also significantly different behavior, namely, a reduction in bursting patterns due to the removal of stochastic components from the update equations.

scholarly journals A Local and Global Search Combined Particle Swarm Optimization Algorithm and Its Convergence Analysis

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Weitian Lin ◽  
Zhigang Lian ◽  
Xingsheng Gu ◽  
Bin Jiao
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Global Search ◽  
Fine Tuning ◽  
Particle Swarm Algorithm ◽  
Swarm Optimization ◽  
Large Size ◽  
Swarm Algorithm

Particle swarm optimization algorithm (PSOA) is an advantage optimization tool. However, it has a tendency to get stuck in a near optimal solution especially for middle and large size problems and it is difficult to improve solution accuracy by fine-tuning parameters. According to the insufficiency, this paper researches the local and global search combine particle swarm algorithm (LGSCPSOA), and its convergence and obtains its convergence qualification. At the same time, it is tested with a set of 8 benchmark continuous functions and compared their optimization results with original particle swarm algorithm (OPSOA). Experimental results indicate that the LGSCPSOA improves the search performance especially on the middle and large size benchmark functions significantly.

Chaotic Particle Swarm Optimization for Automatic Surface or Curve Localization

2014 ◽  
Vol 620 ◽  
pp. 324-328
Author(s):  
Jia Feng Wu ◽  
Dong Li Qin
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Particle Swarm Algorithm ◽  
Euler Angles ◽  
Swarm Optimization ◽  
Chaotic Mapping ◽  
Curve Detection ◽  
Swarm Algorithm ◽  
Chaotic Particle Swarm Optimization

In order to solve the automatic localization problem of the surface or curve detection, this paper presents a method for obtaining a global optimal solution, the method uses particle swarm algorithm to solve the position and orientation. To solve the problem of premature convergence and slow convergence in particle swarm algorithm, a chaotic mapping logistic model is presented to improve the performance of particle swarm algorithm and the shrinking chaotic mutation operator is applied into the method to increase the diversity and ergodicity of particle populations. In this paper, the objective matrix is separately described by quaternion and Euler angles, and the accuracy and convergence of the algorithm are analyzed taken into account these matrices. Simulation results demonstrate that two mentioned expressions can comply with the requirements of adaptive localization, and while Euler angles as optimization variables, chaotic particle swarm optimization have higher accuracy results. Finally, compared to Hong-Tan algorithms, the method is effective and reliable.

scholarly journals Novel Particle Swarm Optimization and Its Application in Calibrating the Underwater Transponder Coordinates

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Zheping Yan ◽  
Chao Deng ◽  
Benyin Li ◽  
Jiajia Zhou
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Benchmark Problems ◽  
Particle Swarm Algorithm ◽  
Time Varying ◽  
Swarm Optimization ◽  
Inertia Weight ◽  
Basic Particle ◽  
Swarm Algorithm ◽  
Speed Accuracy

A novel improved particle swarm algorithm named competition particle swarm optimization (CPSO) is proposed to calibrate the Underwater Transponder coordinates. To improve the performance of the algorithm, TVAC algorithm is introduced into CPSO to present anextension competition particle swarm optimization(ECPSO). The proposed method is tested with a set of 10 standard optimization benchmark problems and the results are compared with those obtained through existing PSO algorithms,basic particle swarm optimization(BPSO),linear decreasing inertia weight particle swarm optimization(LWPSO),exponential inertia weight particle swarm optimization(EPSO), andtime-varying acceleration coefficient(TVAC). The results demonstrate that CPSO and ECPSO manifest faster searching speed, accuracy, and stability. The searching performance for multimodulus function of ECPSO is superior to CPSO. At last, calibration of the underwater transponder coordinates is present using particle swarm algorithm, and novel improved particle swarm algorithm shows better performance than other algorithms.

Sign in / Sign up

Export Citation Format

Share Document