Quick community detection of big graph data using modified Louvain algorithm

Seungyo Ryu, Dong Seung Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings - 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
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1442-1445
Number of pages4
ISBN (Electronic)9781509042968
DOIs
Publication statusPublished - 2017 Jan 20
Event18th 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 - Sydney, Australia
Duration: 2016 Dec 122016 Dec 14

Other

Other18th 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
CountryAustralia
CitySydney
Period16/12/1216/12/14

Keywords

  • Algorithm
  • Community detection
  • Graph mining

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Computer Science Applications
  • Hardware and Architecture
  • Information Systems

Cite this

Ryu, S., & Kim, D. S. (2017). Quick community detection of big graph data using modified Louvain algorithm. In 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 (pp. 1442-1445). [7828546] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/HPCC-SmartCity-DSS.2016.0205

Quick community detection of big graph data using modified Louvain algorithm. / Ryu, Seungyo; Kim, Dong Seung.

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. Institute of Electrical and Electronics Engineers Inc., 2017. p. 1442-1445 7828546.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ryu, S & Kim, DS 2017, Quick community detection of big graph data using modified Louvain algorithm. in 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., 7828546, Institute of Electrical and Electronics Engineers Inc., pp. 1442-1445, 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, Sydney, Australia, 16/12/12. https://doi.org/10.1109/HPCC-SmartCity-DSS.2016.0205
Ryu S, Kim DS. Quick community detection of big graph data using modified Louvain algorithm. In 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. Institute of Electrical and Electronics Engineers Inc. 2017. p. 1442-1445. 7828546 https://doi.org/10.1109/HPCC-SmartCity-DSS.2016.0205
Ryu, Seungyo ; Kim, Dong Seung. / Quick community detection of big graph data using modified Louvain algorithm. 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. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 1442-1445
@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 Kim, {Dong Seung}",
year = "2017",
month = "1",
day = "20",
doi = "10.1109/HPCC-SmartCity-DSS.2016.0205",
language = "English",
pages = "1442--1445",
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",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Quick community detection of big graph data using modified Louvain algorithm

AU - Ryu, Seungyo

AU - Kim, Dong Seung

PY - 2017/1/20

Y1 - 2017/1/20

N2 - 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.

AB - 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.

KW - Algorithm

KW - Community detection

KW - Graph mining

UR - http://www.scopus.com/inward/record.url?scp=85013655836&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85013655836&partnerID=8YFLogxK

U2 - 10.1109/HPCC-SmartCity-DSS.2016.0205

DO - 10.1109/HPCC-SmartCity-DSS.2016.0205

M3 - Conference contribution

AN - SCOPUS:85013655836

SP - 1442

EP - 1445

BT - 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

PB - Institute of Electrical and Electronics Engineers Inc.

ER -