Empirical Performace Determination on Community Detection Techniques in Social Networks
M. Mohamed Iqbal1, K.Latha2
1M. Mohamed Iqbal, Assistant Professor, Department of computer science and engineering,Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology, Chennai.
2K.Latha, Assistant Professor(Sr. Grade), Department of computer science and engineering, Anna University (B.I.T Campus), Trichirappalli.
Manuscript received on February 01, 2020. | Revised Manuscript received on February 05, 2020. | Manuscript published on February 30, 2020. | PP: 200-204 | Volume-9 Issue-3, February, 2020. | Retrieval Number: B4562129219/2020©BEIESP | DOI: 10.35940/ijeat.B4562.029320
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Community identification is the high common and extending field of interest in social and real-time network applications. In recent years, many community detection methods have been developed. This paper describes various community discovery methods such as InfoMap, Clique Guided, Louvain, Newman and Eigen Vector that have already been developed and also compares the experimental results of those proposed techniques. The proposed work in this paper experiments these community mining algorithms on the two real-world datasets Twitter and DBLP (Computer Science Bibliography) networks. The identified communities by all the community mining algorithms for these two data sets are described in this proposed work. The quality of the derived communities is evaluated by using standard Extended Modularity metric. The experiment results show that the InfoMap algorithm produces a good modularity score than other community mining algorithms for different sizes of communities on both data sets.
Keywords: Community Detection, InfoMap, Real time network, community structure, social network.