Abstract
Network clustering problem (NCP) is the problem associated to the detection of network community structures. Building on Markov random walks we address this problem with a new ant colony optimization strategy, named as ACOMRW, which improves prior results on the NCP problem and does not require knowledge of the number of communities present on a given network. The framework of ant colony optimization is taken as the basic framework in the ACOMRW algorithm. At each iteration, a Markov random walk model is taken as heuristic rule; all of the ants’ local solutions are aggregated to a global one through clustering ensemble, which then will be used to update a pheromone matrix. The strategy relies on the progressive strengthening of within-community links and the weakening of between-community links. Gradually this converges to a solution where the underlying community structure of the complex network will become clearly visible. The performance of algorithm ACOMRW was tested on a set of benchmark computer-generated networks, and as well on real-world network data sets. Experimental results confirm the validity and improvements met by this approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Watts, D.J., Strogatz, S.H.: Collective Dynamics of Small-World Networks. Nature 393(6638), 440–442 (1998)
Barabsi, A.L., Albert, R., Jeong, H., Bianconi, G.: Power-law distribution of the World Wide Web. Science 287(5461), 2115a (2000)
Girvan, M., Newman, M.E.J.: Community Structure in Social and Biological Networks. Proceedings of National Academy of Science 9(12), 7821–7826 (2002)
Santo, F.: Community Detection in Graphs. Physics Reports 486(3-5), 75–174 (2010)
Newman, M.E.J.: Fast Algorithm for Detecting Community Structure in Networks. Physical Review EÂ 69(6), 066133 (2004)
Guimera, R., Amaral, L.A.N.: Functional cartography of complex metabolic networks. Nature 433(7028), 895–900 (2005)
Barber, M.J., Clark, J.W.: Detecting Network Communities by Propagating Labels under Constraints. Phys. Rev. EÂ 80(2), 026129 (2009)
Jin, D., He, D., Liu, D., Baquero, C.: Genetic algorithm with local search for community mining in complex networks. In: Proc. of the 22th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2010), pp. 105–112. IEEE Press, Arras (2010)
Palla, G., Derenyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structures of complex networks in nature and society. Nature 435(7043), 814–818 (2005)
Yang, B., Cheung, W.K., Liu, J.: Community Mining from Signed Social Networks. IEEE Trans. on Knowledge and Data Engineering 19(10), 1333–1348 (2007)
Zhang, Y., Wang, J., Wang, Y., Zhou, L.: Parallel Community Detection on Large Networks with Propinquity Dynamics. In: Proc. the 15th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pp. 997–1005. ACM Press, Paris (2009)
Morarescu, C.I., Girard, A.: Opinion Dynamics with Decaying Confidence: Application to Community Detection in Graphs. arXiv:0911.5239v1 (2010)
Strehl, A., Ghosh, J.: Cluster ensembles-a knowledge reuse framework for combining partitionings. Journal of Machine Learning Research 3, 583–617 (2002)
Milgram, S.: The Small World Problem. Psychology Today 1(1), 60–67 (1967)
Albert, R., Jeong, H., Barabasi, A.L.: Diameter of the World Wide Web. Nature 401, 130–131 (1999)
Danon, L., Duch, J., Diaz-Guilera, A., Arenas, A.: Comparing community structure identification. J. Stat. Mech., P09008 (2005)
Zachary, W.W.: An Information Flow Model for conflict and Fission in Small Groups. J. Anthropological Research 33, 452–473 (1977)
Lusseau, D.: The Emergent Properties of a Dolphin Social Network. Proc. Biol. Sci. 270, S186–S188 (2003)
Newman, M.E.J., Girvan, M.: Finding and Evaluating Community Structure in Networks. Phys. Rev. EÂ 69(2), 026113 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jin, D., Liu, D., Yang, B., Baquero, C., He, D. (2011). Ant Colony Optimization with Markov Random Walk for Community Detection in Graphs. In: Huang, J.Z., Cao, L., Srivastava, J. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2011. Lecture Notes in Computer Science(), vol 6635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20847-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-20847-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20846-1
Online ISBN: 978-3-642-20847-8
eBook Packages: Computer ScienceComputer Science (R0)