@inproceedings{038380138fb2482fa1d52b24e7e45b59,
title = "Quick community detection of big graph data using modified Louvain algorithm",
abstract = "Louvain algorithm is known to be fast to deliver good results in detecting communities of big graphs. This paper further speeds up Louvain algorithm by restricting the internal search rules and early pruning the non-promising candidates. Experimental results of the modified algorithm on various sized data show outstanding speedups of up to 40.5 and 4.7 times for weighted graphs and unweighted graphs, respectively.",
keywords = "Algorithm, Community detection, Graph mining",
author = "Seungyo Ryu and Dongseung Kim",
note = "Funding Information: This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (grant number: NRF-2014R1A1A2055769) Publisher Copyright: {\textcopyright} 2016 IEEE.; 18th IEEE International Conference on High Performance Computing and Communications, 14th IEEE International Conference on Smart City and 2nd IEEE International Conference on Data Science and Systems, HPCC/SmartCity/DSS 2016 ; Conference date: 12-12-2016 Through 14-12-2016",
year = "2017",
month = jan,
day = "20",
doi = "10.1109/HPCC-SmartCity-DSS.2016.0205",
language = "English",
series = "Proceedings - 18th IEEE International Conference on High Performance Computing and Communications, 14th IEEE International Conference on Smart City and 2nd IEEE International Conference on Data Science and Systems, HPCC/SmartCity/DSS 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1442--1445",
editor = "Yang, {Laurence T.} and Jinjun Chen",
booktitle = "Proceedings - 18th IEEE International Conference on High Performance Computing and Communications, 14th IEEE International Conference on Smart City and 2nd IEEE International Conference on Data Science and Systems, HPCC/SmartCity/DSS 2016",
}