Extracting natural groups of the unlabeled data is known as clustering. To improve the stability and robustness of the clustering outputs, clustering ensembles have emerged recent...
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
Pham Trung Kien, Nguyen Duy Hiep, Huynh Thi Thanh ...
This paper benchmarks an Estimation of Distribution Algorithm (EDA) and Particle Swarm Optimizer (PSO) on noisefree BBOB 2009 testbed. The algorithm is referred to as EDA-PSO and ...
Simplified forms of the particle swarm algorithm are very beneficial in contributing to understanding of what makes a PSO swarm function in the way that it does. One of these form...
— Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of a simplified form of traditional particle swarm optimization (PSO) without the i...