Abstract
The process of the community reveal has become such a major problem in different fields, in particular for the social networks that have seen a growth over the last decade . Diverse ways of several methods have been proposed to resolve this inference problem. Nevertheless, the computational run time and the used space become a real handicap especially, when the networks are large. In this paper, we introduce a new approach of community detection that relies greatly on a new dissimilarity measure which allows to find the edges having more tendency to be between two communities. Then, we suppress them to have some preliminary communities. After that, we merge the induced subgraphs without using the modularity optimization to avoid its resolution limit. Finally, we evaluate our proposed method on real and artificial networks. The experiments show that our way of detecting communities outperforms or as effective as the existing algorithms (CNM, WalkTrap, InfoMap) while the used space and time complexity are better.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aggarwal CC, Xie Y, Philip SY (2008) Towards community detection in locally heterogeneous networks. In: SDM, Jan, 2011, pp 391–402
Arab M, Afsharchi M (2014) Community detection in social networks using hybrid merging of sub-communities. J Netw Comput Applic 40:73–84
Basuchowdhuri P, Anand S, Srivastava DR, Mishra K, Saha SK (2014) Detection of communities in social networks using spanning tree. Adv Comput Netw Inf 2:589–597
Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008(10):P10008
Chen M, Kuzmin K, Szymanski BK (2014) Community detection via maximization of1 modularity and its variants. IEEE Trans Comput Soc Syst 1(1):46–65
Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6):066111
Donetti L (2004) Detecting network communities: a new systematic and efficient algorithm. J Stat Mech Theory Exp 2004(10):P10012
Fortunato S, Barthelemy M (2007) Resolution limit in community detection. Proc Natl Acad Sci 104(1):36–41
Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821–7826
Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110
Leskovec J, Lang KJ, Mahoney M (2010) Empirical comparison of algorithms for network community detection. In: Proceedings of the 19th international conference on world wide web. ACM, pp 631–640
Liu Z, Li P, Zheng Y, Sun M (2008) Community detection by affinity propagation (No. 001). Technical Report
Nascimento MC (2014) Community detection in networks via a spectral heuristic based on the clustering coefficient. Discrete Appl Math 176:89–99
Pons P, Latapy M (2006) Computing communities in large networks using random walks. J Graph Algorithms Appl 10(2):191–218
Porter MA, Onnela JP, Mucha PJ (2009) Communities in networks. Not AMS 56(9):1082–1097
Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci 105(4):1118–1123
Seth S, Bhattacharyya D, Kim TH (2012) Constraint-based clustering to find communities in a social network. In: Proceedings of international conference on information science and industrial applications (ISI), pp 1–9
Steinhaeuser K, Chawla NV (2008) Community detection in a large real-world social network. In: Social computing, behavioral modeling, and prediction. Springer, US, pp 168–175
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Asmi, K., Lotfi, D. & El Marraki, M. Large-scale community detection based on a new dissimilarity measure. Soc. Netw. Anal. Min. 7, 17 (2017). https://doi.org/10.1007/s13278-017-0436-3
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s13278-017-0436-3