Abstract
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.
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
Palla, G., Derenyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 814–818 (2005)
Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., Parisi, D.: Defining and identifying communities in networks. PNAS 101, 2658–2663 (2004)
Girvan, M., Newman, M.: Community structure in social and biological networks. PNAS 99, 7821–7826 (2002)
Blondel, V., Guillaume, J., Lambiotte, R., Mech, E.: Fast unfolding of communities in large networks. J. Stat. Mech. (2008)
Clauset, A., Newman, M., Moore, C.: Finding community structure in very large networks. Physical Review EÂ 70 (2004)
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)
Lancichinetti, A., Fortunato, S.: Community detection algorithms: a comparative analysis (2009)
Dunn, G., Everitt, B.: An Introduction to Mathematical Taxonomy. Cambridge University Press (1982)
Holland, P., Leinhardt, S.: Transitivity in structural models of small groups. Small Group Research 2, 107–124 (1971)
Prim, R.: Shortest connection networks and some generalizations. The Bell Systems Technical Journal 36, 1389–1401 (1957)
Bastian, M., Heymann, S., Jacomy, M.: Gephi: An open source software for exploring and manipulating networks. In: ICWSM. The AAAI Press (2009)
Zachary, W.: An information flow model for conflict and fission in small groups. Journal of Anthropological Research 33, 452–473 (1977)
Girvan, M., Newman, M.: Community structure in social and biological networks. PNAS 99, 7821–7826 (2002)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Basuchowdhuri, P., Anand, S., Srivastava, D.R., Mishra, K., Saha, S.K. (2014). Detection of Communities in Social Networks Using Spanning Tree. In: Kumar Kundu, M., Mohapatra, D., Konar, A., Chakraborty, A. (eds) Advanced Computing, Networking and Informatics- Volume 2. Smart Innovation, Systems and Technologies, vol 28. Springer, Cham. https://doi.org/10.1007/978-3-319-07350-7_65
Download citation
DOI: https://doi.org/10.1007/978-3-319-07350-7_65
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07349-1
Online ISBN: 978-3-319-07350-7
eBook Packages: EngineeringEngineering (R0)