Detection of Communities in Social Networks Using Spanning Tree
Communities are inherent substructures present in social networks. Yet finding communities from a social network can be a difficult task. Therefore, finding communities from a social network is an interesting problem. Also, due to its use in many practical applications, it is considered to be an important problem in social network analysis and is well-studied. In this paper, we propose a maximum spanning tree based method to detect communities from a social network. Experimental results show that this method can detect communities with high accuracy and with reasonably good efficiency compared to other existing community detection techniques.
KeywordsSocial Networks Community Detection Maximum Spanning Tree
Unable to display preview. Download preview PDF.
- 4.Blondel, V., Guillaume, J., Lambiotte, R., Mech, E.: Fast unfolding of communities in large networks. J. Stat. Mech. (2008)Google Scholar
- 5.Clauset, A., Newman, M., Moore, C.: Finding community structure in very large networks. Physical Review E 70 (2004)Google Scholar
- 6.Chiang, M., Lam, H., Liu, Z., Poor, V.: Why steiner-tree type algorithms work for community detection. In: 16th International Conference on Artificial Intelligence and Statistics (AISTATS) (2013)Google Scholar
- 7.Lancichinetti, A., Fortunato, S.: Community detection algorithms: a comparative analysis (2009)Google Scholar
- 8.Dunn, G., Everitt, B.: An Introduction to Mathematical Taxonomy. Cambridge University Press (1982)Google Scholar
- 11.Bastian, M., Heymann, S., Jacomy, M.: Gephi: An open source software for exploring and manipulating networks. In: ICWSM. The AAAI Press (2009)Google Scholar
- 12.Zachary, W.: An information flow model for conflict and fission in small groups. Journal of Anthropological Research 33, 452–473 (1977)Google Scholar
- 14.Lusseau, D., Newman, M.: Identifying the role that animals play in their social networks. Proceedings of the Royal Society of London. Series B: Biological Sciences 271, S477–S481 (2004)Google Scholar