2011
DOI: 10.1103/physreve.83.036103
|View full text |Cite
|
Sign up to set email alerts
|

Unfolding communities in large complex networks: Combining defensive and offensive label propagation for core extraction

Abstract: Label propagation has proven to be a fast method for detecting communities in large complex networks. Recent developments have also improved the accuracy of the approach; however, a general algorithm is still an open issue. We present an advanced label propagation algorithm that combines two unique strategies of community formation, namely, defensive preservation and offensive expansion of communities. The two strategies are combined in a hierarchical manner to recursively extract the core of the network and t… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

3
159
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 184 publications
(162 citation statements)
references
References 45 publications
3
159
0
Order By: Relevance
“…Using a data-driven community Louvain approach (13), cortical regions of interest (ROIs) were assigned to a cortical module, where each module represents a set of cortical ROIs that have maximum connections with each other but minimum connections with all other regions outside the module. This resulted in 6 modules, 3 in the left hemisphere and 3 in the right hemisphere.…”
Section: Resultsmentioning
confidence: 99%
“…Using a data-driven community Louvain approach (13), cortical regions of interest (ROIs) were assigned to a cortical module, where each module represents a set of cortical ROIs that have maximum connections with each other but minimum connections with all other regions outside the module. This resulted in 6 modules, 3 in the left hemisphere and 3 in the right hemisphere.…”
Section: Resultsmentioning
confidence: 99%
“…The multilevel community (18) function of the igraph package (R/igraph 1.0.0; ) was utilized for network module mining. Screening of the modules containing >15 genes was used to perform differential expression analysis in the GSE16088 profile using the GlobalAncova package in R language (version 3.42.0; ).…”
Section: Methodsmentioning
confidence: 99%
“…Besides structure based method like CPM, overlapping community detection could also be modeled as link-partition problem [2,10,18]. It first converts the original graph G into link graph L(G), in which each node is a link of L(G), and two nodes are adjacent if the two links they represent have common node in G. Then link partition of G can be mapped to node partition of L(G), and by performing random walk [10], Jaccard-type similarity computation [2], or density-based clustering algorithm SCAN [18], node clusters of L(G) are derived and then they can be converted to overlapping node communities of G. Label propagation method has been also widely used for detecting communities [14,26], they propagate all nodes' labels to their neighbors for one step to make their community membership reach a consensus. Compared to OCD, OCS is more light-weight and flexible, it only needs to explore a part of the graph around the query nodes, but not the whole graph, thus it is more appropriate for online query.…”
Section: Related Workmentioning
confidence: 99%