A Novel Ant Colony Optimization Algorithm with Dynamic Control Population for Community Detecting
Nowadays, complex networks have driven great interests of scholars. As a special characteristic of a network, the community structure has wide research prospects. Many current algorithms are adopted for detecting the potential community structure, in which the ant colony algorithm is a typical one. However, the computational cost of the ant colony is too high which limits its performance. In this paper, we propose a novel ant colony optimization algorithm with dynamic control population. In the proposed algorithm, when a certain condition is reached, the number of ants starts to decrease based on the proposed rules. The efficiency of the proposed algorithm is estimated through comparing with the classical ant colony algorithm in real-world networks. Experiments show that the proposed algorithm has apparently lower computational cost, while the quality of the division is reserved relatively.
KeywordsCommunity mining Ant colony optimization Dynamic control population
This work was supported by National Natural Science Foundation of China (No. 61602391), Natural Science Foundation of Chongqing (No. cstc2018jcyjAX0274), and in part by the National Training Programs of Innovation and Entrepreneurship for Undergraduates.
- 5.Ruan, J.H., Zhang, W.X.: An efficient spectral algorithm for network community discovery and its applications to biological and social networks. In: 7th IEEE International Conference on Data Mining, pp. 643–648 (2007)Google Scholar
- 16.Mu, C.H., Zhang, J., Jiao, L.C.: An intelligent ant colony optimization for community detection in complex networks. In: 2014 IEEE Congress on Evolutionary Computation, pp. 700–706 (2014)Google Scholar
- 19.Jin, D., Chen, Z., He, D.X., Zhang, W.X.: Modeling with node degree preservation can accurately find communities. In: The 29th AAAI Conference on Artificial Intelligence, pp. 160–167 (2015)Google Scholar