Abstract
Community Detection is a significant tool for understanding the structures of real-world networks. Although many novel methods have been applied in community detection, as far as we know, cooperative method has not been applied into community detection to improve the performance of discovering community structure of social networks. In this paper, we propose a cooperative community detection algorithm, named cooperative community detection algorithm based on random walks. Firstly, it uses random walks to calculate the similarities between adjacent nodes, and then translates a given unweighted networks into weighted networks based on the similarities between adjacent nodes. Secondly, it detects community structures of networks by activating the neighbors a node whose community label is known. Thirdly, it cooperates running results of many times of our community detection algorithm to improve its accuracy and stability. Finally, we demonstrate our community detection algorithm with three real networks, and the experimental results show that our cooperative semi-supervised method has a higher accuracy and more stable results compared with other random community detection algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Girvan, M., Newman, M.E.J.: Community Structure in Social and Biological Networks. Proc. Natl. Acad. Sci. 99, 7821–7826 (2002)
Clauset, A., Newman, M.E.J., Moore, C.: Finding Community Structure in Very Large Network. Phys. Rev. E 70, 066111 (2004)
Raghavan, U.N., Albert, R., Kumara, S.: Near Linear Time Algorithm to Detect Community Structures in Large-scale Networks. Phs. Rev. E 76, 036106 (2007)
Barber, M.J., Clark, J.W.: Detecting Network Communities by Propagating Labels under Constraints. Phys. Rev. E 80, 026129 (2009)
Liu, X., Murata, T.: Advanced Modularity-specialized Label Propagation Algorithm for Detecting Communities in Networks. Physica A 389, 1493–1500 (2010)
Herbiet, G.J., Bouvry, P.: SHARC: Community-based Partitioning for Mobile Ad Hoc Networks Using Neighborhood Similarity. In: IEEE International Symposium on “A World of Wireless, Mobile and Multimedia Networks”, pp. 1–9. IEEE Press, New York (2010)
Newman, M.E.J., Girvan, M.: Finding and Evaluating Community Structure in Networks. Physical Review E - Statistical, Nonlinear, and Soft Matter Physics 69, 026113 (2004)
Steinhaeuser, K., Chawla, N.V.: Identifying and Evaluating Community Structure in Complex Networks. Pattern Recognition 31, 413–421 (2010)
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the Spread of Influence Through a Social Network. In: 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2003, pp. 137–146. ACM Press, New York (2003)
Kashef, R., Kamel, M.S.: Cooperative Clustering. Pattern Recognition 43, 2315–2329 (2010)
Lovász, L.: Random Walks on Graphs:A Survey. Combinatorics, Paul Erdos is Eighty 2, 353–397 (1993)
van Dongen, S.M.: Graph Clustering by Flow Simulation. Ph.D.Thesis, Universiteit Utrecht, Utrecht, The Netherlands (May 2000)
Narayanam, R., Narahari, Y.: A Shapley Value Based Approach to Discover Influential Nodes in Social Networks. IEEE Transactions on Automation Science and Engineering 8, 130–147 (2011)
Cao, L.: In-depth Behavior Understanding and Use: the Behavior Informatics Approach. Information Science 180(17), 3067–3085 (2010)
Eng, Y., Kwoh, C., Zhou, Z.: On the Two-level Hybrid Clustering Algorithm. In: International Conference on Artificial Intelligence in Science and Technology, pp. 138–142 (2004)
Xu, S., Zhang, J.: A Hybrid Parallel Web Document Clustering Algorithm and its Performance Study. Journal of Supercomputing 30, 117–131 (2004)
Wayne, W.: Zachary: An Information Flow Model for Conflict and Fission in Small Groups. Journal of Anthropological Research 33, 452–473 (1977)
Lusseau, D., Schneider, K., Boisseau, O.J., Haase, P., Slooten, E., Dawson, S.M.: The Bottlenose Dolphin Community of Doubtful Sound Features a Large Proportion of Long-lasting Associations. Behavioral Ecology and Sociobiology 54, 396–405 (2003)
David, L., Newman, M.E.J.: Identifying the Role That Animals Play in Their Social Networks. In: Proc. R. Soc. B, pp. S477–S481. Royal Society Publishing, London (2004)
Chen, D., Shang, M., Lv, Z., Fu, Y.: Detecting Overlapping Communities of Weighted Networks via a Loacal Algorithm. Physica A 389, 4177–4187 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Leng, M., Lv, W., Cheng, J., Li, Z., Chen, X. (2013). Cooperative Community Detection Algorithm Based on Random Walks. In: Cao, L., et al. Behavior and Social Computing. BSIC BSI 2013 2013. Lecture Notes in Computer Science(), vol 8178. Springer, Cham. https://doi.org/10.1007/978-3-319-04048-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-04048-6_17
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-04047-9
Online ISBN: 978-3-319-04048-6
eBook Packages: Computer ScienceComputer Science (R0)