Abstract
Community mining is a vital problem for complex network analysis. Markov chains based algorithms are known as its easy-to-implement and have provided promising solutions for community mining. Existing Markov clustering algorithms have been optimized from the aspects of parallelization and penalty strategy. However, the dynamic process for enlarging the inhomogeneity attracts little attention. As the key mechanism of Markov chains based algorithms, such process affects the qualities of divisions and computational cost directly. This paper proposes a hybrid algorithm based on Physarum, a kind of slime. The new algorithm enhances the dynamic process of Markov clustering algorithm by embedding the Physarum-inspired feedback system. Specifically, flows between vertexes can enhance the corresponding transition probability in Markov clustering algorithms, and vice versa. Some networks with known and unknown community structures are used to estimate the performance of our proposed algorithms. Extensive experiments show that the proposed algorithm has higher NMI, Q values and lower computational cost than that of the typical algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75–174 (2010)
Centola, D.: The spread of behavior in an online social network experiment. Science 329(5996), 1194–1197 (2010)
Satuluri, V., Parthasarathy, S.: Scalable graph clustering using stochastic flows: applications to community discovery. In: The 15th International Conference on Knowledge Discovery and Data Mining, pp. 737–746. ACM (2009)
Niu, Q., Lai, P.W., Faisal, S.M., Parthasarathy, S., Sadayappan, P.: A fast implementation of MLR-MCL algorithm on multi-core processors. In: The 21st International Conference on High Performance Computing, pp. 1–10. IEEE (2014)
Satuluri, V., Parthasarathy, S., Ucar, D.: Markov clustering of protein interaction networks with improved balance and scalability. In: The 1st ACM International Conference on Bioinformatics and Computational Biology, BCB 2010, pp. 247–256. ACM, New York (2010)
Nakagaki, T., Yamada, H., Tóth, Á.: Intelligence: Maze-solving by an amoeboid organism. Nature 407(6803), 470 (2000)
Tero, A., Takagi, S., Saigusa, T., Ito, K., Bebber, D.P., Fricker, M.D., Yumiki, K., Kobayashi, R., Nakagaki, T.: Rules for biologically inspired adaptive network design. Science 327(5964), 439–442 (2010)
Liu, Y., Gao, C., Zhang, Z., Wu, Y., Liang, M., Tao, L., Lu, Y.: A new multi-agent system to simulate the foraging behaviors of Physarum. Nat. Comput. 16, 15–29 (2017)
Tero, A., Kobayashi, R., Nakagaki, T.: A mathematical model for adaptive transport network in path finding by true slime mold. J. Theor. Biol. 244(4), 553–564 (2007)
Liu, Y.X., Gao, C., Zhang, Z.L., Lu, Y.X., Chen, S., Liang, M.X., Li, T.: Solving NP-hard problems with Physarum-based ant colony system. IEEE/ACM Trans. Comput. Biol. Bioinf. 14(1), 108–120 (2017)
Van Dongen, S.M.: Graph clustering by flow simulation. Ph.D. thesis, Universiteit Utrecht (2001)
Karrer, B., Newman, M.E.: Stochastic blockmodels and community structure in networks. Phys. Rev. E 83(1), 016107 (2011)
Tabrizi, S.A., Shakery, A., Asadpour, M., Abbasi, M., Tavallaie, M.A.: Personalized pagerank clustering: a graph clustering algorithm based on random walks. Phys. A 392(22), 5772–5785 (2013)
Jin, D., Chen, Z., He, D., Zhang, W.: Modeling with node degree preservation can accurately find communities. In: The 24th International Conference on Artificial Intelligence, AAAI, pp. 160–167 (2015)
Sobolevsky, S., Campari, R., Belyi, A., Ratti, C.: General optimization technique for high-quality community detection in complex networks. Phys. Rev. E 90, 012811 (2014)
Acknowledgement
Prof. Zili Zhang and Dr. Chao Gao are the corresponding authors. This work is supported by the National Natural Science Foundation of China (Nos. 61403315, 61402379), CQ CSTC (No. cstc2015gjhz40002), Fundamental Research Funds for the Central Universities (Nos. XDJK2016A008, XDJK2016B029, XDJK2016D053) and Chongqing Graduate Student Research Innovation Project (No. CYS16067).
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Liang, M., Gao, C., Li, X., Zhang, Z. (2017). An Enhanced Markov Clustering Algorithm Based on Physarum . In: Kim, J., Shim, K., Cao, L., Lee, JG., Lin, X., Moon, YS. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2017. Lecture Notes in Computer Science(), vol 10234. Springer, Cham. https://doi.org/10.1007/978-3-319-57454-7_38
Download citation
DOI: https://doi.org/10.1007/978-3-319-57454-7_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-57453-0
Online ISBN: 978-3-319-57454-7
eBook Packages: Computer ScienceComputer Science (R0)