neo4j-graph-algorithms
neo4j-graph-algorithms copied to clipboard
Info: algo.louvain
Hello, can be useful implement in algo.louvain what described here: http://www.ijcee.org/vol8/927-A023.pdf Abstract: The Louvain algorithm is well known for its high speed for detecting community structure in networks. In this paper, first, we analyze the Louvain algorithm as the preliminary experiment to uncover the processes that cause wasted computational time and their characteristics. Then based on this, we propose the Louvain Prune algorithm. The experiments show that the Louvain Prune algorithm significantly reduces computational time by up to 90%, and retains almost the same quality as the original Louvain algorithm.