2018
DOI: 10.1016/j.physa.2017.09.090
|View full text |Cite
|
Sign up to set email alerts
|

Phase transition of Surprise optimization in community detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
1
1

Relationship

3
4

Authors

Journals

citations
Cited by 11 publications
(6 citation statements)
references
References 60 publications
0
6
0
Order By: Relevance
“…Our method can effectively improve the structure of original networks to enhance the ability of network embedding algorithms. Due to the improvement of network structure, some problems of other network analysis algorithms may also be solved or improved, such as the resolution limit in community detection [52,53]. Some studies have shown that network enhancement can mitigate the Frontiers in Physics frontiersin.org resolution limit and improve traditional community detection algorithms [35,54].…”
Section: Conclusion and Discussionmentioning
confidence: 99%
“…Our method can effectively improve the structure of original networks to enhance the ability of network embedding algorithms. Due to the improvement of network structure, some problems of other network analysis algorithms may also be solved or improved, such as the resolution limit in community detection [52,53]. Some studies have shown that network enhancement can mitigate the Frontiers in Physics frontiersin.org resolution limit and improve traditional community detection algorithms [35,54].…”
Section: Conclusion and Discussionmentioning
confidence: 99%
“…For example, Disease Module Identification DREAM Challenge specifies a valid module size between 3 and 100 (Choobdar, et al, 2019). Furthermore, some module identification algorithms may split a large module into several small submodules, or aggregate several small modules into a large one, because of the resolution related to the intrinsic definition or mechanism of algorithms (Fortunato and Barthé lemy, 2007;Xiang, et al, 2018;Xiang, et al, 2017). In this case, algorithms with flexible resolution may more effectively mine the module structures of networks.…”
Section: /mentioning
confidence: 99%
“…This means that the partition for x=1, 2 and 3 will be preferred in turn. Other statistical measures such original surprise and modularity have similar behaviors, but the critical points are different for different statistical measures [34].…”
Section: Critical Behavior Of Asymptotic Surprise and Its Resolutionmentioning
confidence: 99%
“…Many methods have been proposed to identify the communities in complex networks by various approaches [9][10][11][12][13][14][15][16][17][18], such as spectral analysis [18], random walk [19][20][21], dynamics [22][23][24][25], label propagation [26], and modularity optimization [27,28]. The existing methods could indeed help reveal intrinsic structures in the networks, but they also have respective scopes of application, and thus it is necessary to study their behaviors, e.g., the resolution in community detection [29][30][31][32][33][34][35]. This could help understand the methods themselves in depth and promote the development of community-detection methods.…”
Section: Introductionmentioning
confidence: 99%