scholarly journals Large-Scale Complex Network Community Detection Combined with Local Search and Genetic Algorithm

2020 ◽  
Vol 10 (9) ◽  
pp. 3126
Author(s):  
Desheng Lyu ◽  
Bei Wang ◽  
Weizhe Zhang
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Community Structure ◽  
Local Search ◽  
Complex Networks ◽  
Community Detection ◽  
Large Scale ◽  
Particle Swarm ◽  
Search Performance ◽  
Swarm Optimization

With the development of network technology and the continuous advancement of society, the combination of various industries and the Internet has produced many large-scale complex networks. A common feature of complex networks is the community structure, which divides the network into clusters with tight internal connections and loose external connections. The community structure reveals the important structure and topological characteristics of the network. The detection of the community structure plays an important role in social network analysis and information recommendation. Therefore, based on the relevant theory of complex networks, this paper introduces several common community detection algorithms, analyzes the principles of particle swarm optimization (PSO) and genetic algorithm and proposes a particle swarm-genetic algorithm based on the hybrid algorithm strategy. According to the test function, the single and the proposed algorithm are tested, respectively. The results show that the algorithm can maintain the good local search performance of the particle swarm optimization algorithm and also utilizes the good global search ability of the genetic algorithm (GA) and has good algorithm performance. Experiments on each community detection algorithm on real network and artificially generated network data sets show that the particle swarm-genetic algorithm has better efficiency in large-scale complex real networks or artificially generated networks.

Deep autoencoder-based community detection in complex networks with particle swarm optimization and continuation algorithms

2021 ◽  
pp. 1-17
Author(s):  
Mohammed Al-Andoli ◽  
Wooi Ping Cheah ◽  
Shing Chiang Tan
Keyword(s):  
Particle Swarm Optimization ◽  
Complex Networks ◽  
Learning Community ◽  
Community Detection ◽  
Particle Swarm ◽  
Premature Convergence ◽  
Swarm Optimization ◽  
Detection Algorithms ◽  
Real World Datasets ◽  
The Cost

Detecting communities is an important multidisciplinary research discipline and is considered vital to understand the structure of complex networks. Deep autoencoders have been successfully proposed to solve the problem of community detection. However, existing models in the literature are trained based on gradient descent optimization with the backpropagation algorithm, which is known to converge to local minima and prove inefficient, especially in big data scenarios. To tackle these drawbacks, this work proposed a novel deep autoencoder with Particle Swarm Optimization (PSO) and continuation algorithms to reveal community structures in complex networks. The PSO and continuation algorithms were utilized to avoid the local minimum and premature convergence, and to reduce overall training execution time. Two objective functions were also employed in the proposed model: minimizing the cost function of the autoencoder, and maximizing the modularity function, which refers to the quality of the detected communities. This work also proposed other methods to work in the absence of continuation, and to enable premature convergence. Extensive empirical experiments on 11 publically-available real-world datasets demonstrated that the proposed method is effective and promising for deriving communities in complex networks, as well as outperforming state-of-the-art deep learning community detection algorithms.

A Memetic Particle Swarm Optimization Algorithm for Community Detection in Complex Networks

2016 ◽  
Vol 30 (02) ◽  
pp. 1659003 ◽  
Author(s):  
Cheng Zhang ◽  
Xinhong Hei ◽  
Dongdong Yang ◽  
Lei Wang
Keyword(s):  
Particle Swarm Optimization ◽  
Complex Networks ◽  
Community Detection ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Optimization Methods ◽  
Limit Problem ◽  
Resolution Limit ◽  
Swarm Optimization

In recent years, community detection has become a hot research topic in complex networks. Many of the proposed algorithms are for detecting community based on the modularity Q. However, there is a resolution limit problem in modularity optimization methods. In order to detect the community structure more effectively, a memetic particle swarm optimization algorithm (MPSOA) is proposed to optimize the modularity density by introducing particle swarm optimization-based global search operator and tabu local search operator, which is useful to keep a balance between diversity and convergence. For comparison purposes, two state-of-the-art algorithms, namely, meme-net and fast modularity, are carried on the synthetic networks and other four real-world network problems. The obtained experiment results show that the proposed MPSOA is an efficient heuristic approach for the community detection problems.

Comparative Study of Path Planning by Particle Swarm Optimization and Genetic Algorithm

2014 ◽  
Vol 687-691 ◽  
pp. 1420-1424
Author(s):  
Hai Tao Han ◽  
Wan Feng Ji ◽  
Yao Qing Zhang ◽  
De Peng Sha
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Path Planning ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Search Performance ◽  
Operational Environment ◽  
Swarm Optimization ◽  
Vehicle Path ◽  
Swarm Intelligence Algorithm

Two main requirements of the optimization problems are included: one is finding the global minimum, the other is obtaining fast convergence speed. As heuristic algorithm and swarm intelligence algorithm, both particle swarm optimization and genetic algorithm are widely used in vehicle path planning because of their favorable search performance. This paper analyzes the characteristics and the same and different points of two algorithms as well as making simulation experiment under the same operational environment and threat states space. The result shows that particle swarm optimization is superior to genetic algorithm in searching speed and convergence.

A Novel Combined Particle Swarm Optimization and Genetic Algorithm MPPT Control Method for Multiple Photovoltaic Arrays at Partial Shading

2012 ◽  
Vol 135 (1) ◽  
Author(s):  
Liqun Liu ◽  
Chunxia Liu
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Large Scale ◽  
Control Method ◽  
Particle Swarm ◽  
Pv System ◽  
Maximum Power Point ◽  
Partial Shading ◽  
Swarm Optimization ◽  
Power Point

The output characteristics of multiple photovoltaic (PV) arrays at partial shading are characterized by multiple steps and peaks. This makes that the maximum power point tracking (MPPT) of a large scale PV system becomes a difficult task. The conventional MPPT control method was unable to track the maximum power point (MPP) under random partial shading conditions, making the output efficiency of the PV system is low. To overcome this difficulty, in this paper, an improved MPPT control method with better performance based on the genetic algorithm (GA) and adaptive particle swarm optimization (APSO) algorithm is proposed to solve the random partial shading problem. The proposed genetic algorithm adaptive particle swarm optimization (GAAPSO) method conveniently can be used in the real-time MPPT control strategy for large scale PV system, and the implementation of the collect circuit is easy to gain the global peak of multiple PV arrays, thereby resulting in lower cost, higher overall efficiency. The proposed GAAPSO method has been experimentally validated by using several illustrative examples. Simulations and experimental results demonstrate that the GAAPSO method provides effective, fast, and perfect tracking.

Sign in / Sign up

Export Citation Format

Share Document