Abstract
Community detection in social networks requires a careful effort in capturing relationships between individual nodes and identifying the different communities in the network. Contemporary research in this field has so far not considered nodes to be belonging to multiple communities. In this paper, the Community Detection Problem is solved by converting the social network graph to a low-dimensional space of features is attempted. By adopting flexibility in exploring a node’s neighbourhood, overlapping communities are captured. Two kinds of node neighbourhoods based on hop distance and functionality is defined and incorporated both local and global graph representation. Our algorithm is validated by applying it to large social network datasets and visualizing the number of clusters obtained. The clusters depict the various parameters on which the communities have been separated into. The larger the number of clusters, the larger is the complexity of the communities that the dataset has been separated into. On the whole, our work presents a novel approach towards community detection by using overlapping communities in a social network graph.
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
References
Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6)
Pons P, Latapy M (2006) Computing communities in large networks using random walks. J Graph Algorithms Appl 10(2):191–218
Gao W, Wong KF, Xia Y, Xu R (2006) Clique percolation method for finding naturally cohesive and overlapping document clusters, pp 97–108
Yang J, Leskovec J (2015) Defining and evaluating network communities based on ground-truth. Knowl Inf Syst 42:181–213
Jokar E, Mosleh M (2018) Community detection in social networks based on improved label propagation algorithm and balanced link density. Phys Lett A 383:718–727
Henderson K, Gallagher B, Li L, Akoglu L, Rad TE, Tong H, Faloutsos C (2011) It’s who you know: graph mining using recursive structural features, KDD
Belkin M, Niyogi P (2001) Laplacian eigenmaps and spectral techniques for embedding and clustering. NIPS
Tenenbaum JB, Silva VD, Langford JC (2000) A global geometric framework for nonlinear dimensionality reduction. Science 290:2319–2323
Jia H, Ding S, Xu X et al (2014) The latest research progress on spectral clustering. Neural Comput Appl 24:1477–1486
Bamler R, Mandt S (2017) Dynamic word embeddings via skip-gram filtering
Tschoepe M (2019) Beyond SGD: recent improvements of gradient descent methods
Perozzi B, Rfou RA, Skiena S (2014) DeepWalk: online learning of social representations. KDD
Tang J, Qu M, Wang M, Zhang M, Yan J, Mei Q (2015) LINE: large-scale information network embedding, pp 1067–1077
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Rahul, Bansal, P., Goel, P., Nayak, P. (2021). Community Detection Using Graphical Relationships. In: Ranganathan, G., Chen, J., Rocha, Á. (eds) Inventive Communication and Computational Technologies. Lecture Notes in Networks and Systems, vol 145. Springer, Singapore. https://doi.org/10.1007/978-981-15-7345-3_84
Download citation
DOI: https://doi.org/10.1007/978-981-15-7345-3_84
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-7344-6
Online ISBN: 978-981-15-7345-3
eBook Packages: EngineeringEngineering (R0)