Seungyo Ryu

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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(More)
  • 1