Abstract
Many real-world social networks exist in the form of a complex network, which includes very large scale networks with structured or unstructured data and a set of graphs. This complex network is available in the form of brain graph, protein structure, food web, transportation system, World Wide Web, and these networks are sparsely connected, and most of the subgraphs are densely connected. Due to the scaling of large scale graphs, efficient way for graph generation, complexity, the dynamic nature of graphs, and community detection are challenging tasks. From large scale graph to find the densely connected subgraph from the complex network, various community detection algorithms using clustering techniques are discussed here. In this paper, we discussed the taxonomy of various community detection algorithms like Structural Clustering Algorithm for Networks (SCAN), Structural-Attribute based Cluster (SA-cluster), Community Detection based on Hierarchical Clustering (CDHC), etc. In this comprehensive review, we provide a classification of community detection algorithm based on their approach, dataset used for the existing algorithm for experimental study and measure to evaluate them. In the end, insights into the future scope and research opportunities for community detection are discussed.
Keywords: Graph clustering, community detection, complex network, collaborative similarity, vertex similarity, data set of community detections.
Graphical Abstract
[http://dx.doi.org/10.1016/j.techfore.2015.12.019]
[http://dx.doi.org/10.1109/JPROC.2017.2786710] [PMID: 30559531]
[http://dx.doi.org/10.1016/S0169-7552(98)00110-X]
[http://dx.doi.org/10.1109/DCC.2001.917152]
[http://dx.doi.org/10.1145/2433396.2433495]
[http://dx.doi.org/10.1145/1348549.1348552]
[http://dx.doi.org/10.1017/CBO9780511815478]
[http://dx.doi.org/10.1145/1281192.1281280]
[http://dx.doi.org/10.1073/pnas.0601602103]
[http://dx.doi.org/10.14778/1687627.1687709]
[http://dx.doi.org/10.1016/j.physa.2016.11.015]
[http://dx.doi.org/10.1109/TKDE.2013.48]
[http://dx.doi.org/10.1109/ICDM.2010.41]
[http://dx.doi.org/10.1007/s11036-013-0489-0]
[http://dx.doi.org/10.14778/2212351.2212354]
[http://dx.doi.org/10.1109/IC3.2013.6612229]
[http://dx.doi.org/10.1016/j.parco.2014.07.003]
[http://dx.doi.org/10.1016/j.compfluid.2013.10.035]
[http://dx.doi.org/10.1016/j.neucom.2019.01.095]
[http://dx.doi.org/10.5121/ijscai.2016.5105]
[http://dx.doi.org/10.5121/ijscai.2016.5104]
[http://dx.doi.org/10.5958/0975-8089.2017.00016.1]
[http://dx.doi.org/10.1016/j.physa.2012.11.003]
[http://dx.doi.org/10.1016/j.physa.2015.03.044]
[http://dx.doi.org/10.1016/j.physa.2017.05.032]
[http://dx.doi.org/10.1016/j.physa.2018.02.133]
[http://dx.doi.org/10.1086/jar.33.4.3629752]
[http://dx.doi.org/10.1145/1134271.1134277]
[http://dx.doi.org/10.1007/s00265-003-0651-y]
[http://dx.doi.org/10.1103/PhysRevE.69.026113] [PMID: 14995526]
[http://dx.doi.org/10.1007/s10115-013-0693-z]
[http://dx.doi.org/10.1609/aimag.v29i3.2157]