2021
DOI: 10.1155/2021/1485592
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Louvain Algorithm for Community Detection

Abstract: Social network analysis has important research significance in sociology, business analysis, public security, and other fields. The traditional Louvain algorithm is a fast community detection algorithm with reliable results. The scale of complex networks is expanding larger all the time, and the efficiency of the Louvain algorithm will become lower. To improve the detection efficiency of large-scale networks, an improved Fast Louvain algorithm is proposed. The algorithm optimizes the iterative logic from the c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 29 publications
(15 citation statements)
references
References 40 publications
(41 reference statements)
0
15
0
Order By: Relevance
“…Louvain algorithm [13] is a modularity-based community detection algorithm that can achieve fast clustering of network nodes, especially for networks with lots of nodes but fewer links. And there are lots of community detection methods [14,15] based on Louvain algorithm. But all the above algorithms could only realize the clusters on graph with its structure, leading to rough aggregation of nodes.…”
Section: Clusters and Communitiesmentioning
confidence: 99%
See 1 more Smart Citation
“…Louvain algorithm [13] is a modularity-based community detection algorithm that can achieve fast clustering of network nodes, especially for networks with lots of nodes but fewer links. And there are lots of community detection methods [14,15] based on Louvain algorithm. But all the above algorithms could only realize the clusters on graph with its structure, leading to rough aggregation of nodes.…”
Section: Clusters and Communitiesmentioning
confidence: 99%
“…Modularity [14] is a commonly used property to measure the division of network communities. e value of modularity mainly depends on the distribution of nodes in the communities of the network, namely, the community division of the network.…”
Section: Modularity Modelmentioning
confidence: 99%
“…Initialization of GCDNMF. Since the NMF-based approach is sensitive to random initial values of the variables, to overcome this problem, the node membership matrix H of our model is initialized based on our previously presented work K-rank-D [38], which utilizes the centrality and dispersion of the network to determine the cluster centers.…”
Section: Joint Community Detection Modelmentioning
confidence: 99%
“…To formulate the centrality of nodes in the network, according to the algorithm in [38], by modifying the transition probability matrix P, where P ij = A ij /∑ j A ij , we get the centrality of nodes by:…”
Section: Joint Community Detection Modelmentioning
confidence: 99%
“…proposed an improved Fast Louvain algorithm based on the traditional Louvain algorithm, which is superior to the traditional method in effect and efficiency [5]. Some scholars use big data technology to mine the characteristics of network public opinion.…”
Section: Literature Review 21 Research On Internet Public Opinionmentioning
confidence: 99%