Community mining is a crucial and essential problem in complex networks analysis. Many algorithms have been proposed for solving such problem. However, the weaker robustness and lower accuracy still limit their efficiency. Aiming to overcome those shortcomings, this paper proposes a general Physarum-based computational framework for community mining. The proposed framework takes advantages of a unique characteristic of a Physarum-inspired network mathematical model, which can differentiate inter-community edges from intra-community edges in different type of networks and improve the efficiency of original detection algorithms. Some typical algorithms (e.g., genetic algorithm, ant colony optimization algorithm, and Markov clustering algorithm) and six real-world datasets have been used to estimate the efficiency of our proposed computational framework. Experiments show that the algorithms optimized by Physarum-inspired network mathematical model perform better than the original ones for community mining, in terms of robustness and accuracy. Moreover, a computational complexity analysis verifies the scalability of proposed framework.
['Mingxin Liang', 'Xianghua Li', 'Zili Zhang']
A Physarum-Based General Computational Framework for Community Mining