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

An improved algorithm for generalized community structure inference in complex networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…Different communities have diverse characteristics which can complement each other. Because of its significance in social network analysis, lots of scholars in a variety of fields have paid attention to the identification of community structure and numerous classic methods have been developed to obtain optimal solutions, such as Girvan-Newman algorithm [32], VOS Clustering [33], topic oriented community detection approach [34], information-theoretic approach for detecting communities [35], degree-corrected block model [36], integrating center locating and membership optimization algorithm [37], and improved algorithm based on the random graph models [38], et al…”
Section: Introductionmentioning
confidence: 99%
“…Different communities have diverse characteristics which can complement each other. Because of its significance in social network analysis, lots of scholars in a variety of fields have paid attention to the identification of community structure and numerous classic methods have been developed to obtain optimal solutions, such as Girvan-Newman algorithm [32], VOS Clustering [33], topic oriented community detection approach [34], information-theoretic approach for detecting communities [35], degree-corrected block model [36], integrating center locating and membership optimization algorithm [37], and improved algorithm based on the random graph models [38], et al…”
Section: Introductionmentioning
confidence: 99%