4.7 Article

A Parallel Social Spider Optimization Algorithm Based on Emotional Learning

Journal

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSMC.2018.2883329

Keywords

Clustering; emotional learning; parallel; social spider optimization (SSO)

Funding

  1. National Natural Science Foundation of China [61472139, 61462073]
  2. Information Development Special Funds of Shanghai Economic and Information Commission [201602008]
  3. Open Funds of Shanghai Smart City Collaborative Innovation Center

Ask authors/readers for more resources

Social spider optimization is an effective swarm algorithm for solving complex optimization problems by simulating cooperative behavior of spiders, but it suffers from long computation time and premature convergence on some problems. To improve search performance, a parallel SSO algorithm with emotional learning is proposed, which accelerates computation speed by parallel position update and enhances search ability by increasing swarm diversity.
Social spider optimization (SSO) is a swarm algorithm designed for solving complex optimization problems. It is an effective approach for searching a global optimum by simulating the cooperative behavior of social-spiders. However, SSO takes too much computation time and shows premature convergence on some problems. In order to accelerate the computation speed and further enhance the search ability, a parallel SSO (PSSO) algorithm with emotional learning is proposed in this paper. First, we develop a parallel structure for the female and male individuals to update their positions, and each individual can be computed in parallel during the search process. Second, an emotional learning mechanism is used to increase swarm diversity which is helpful to improve the search performance. Furthermore, the convergence property and computational complexity of PSSO are discussed in detail. To test the effectiveness of the proposed algorithm, it is applied to solve data clustering problem. The experimental results demonstrate that the overall performance of PSSO is superior to six other clustering algorithms on several standard data sets. In the aspect of search performance, the results obtained by PSSO are better than the comparison algorithms in most used data sets. In the aspect of time performance, the computation time of PSSO is greatly reduced in the parallel computing environment. It is comparable with K-means which is the fastest among the comparison algorithms when the number of processors larger than and equals to 16.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available