2016
DOI: 10.12720/jcm.11.5.484-490
|View full text |Cite
|
Sign up to set email alerts
|

Community Detection in Weighted Networks via Recursive Edge-Filtration

Abstract: In this paper, we present a Weighted Filtration Coefficient (WFC)  and a corresponding filtration method to detect the communities in weighted networks. In our method, a weighted network can be divided into groups by recursive filtration operations, and the dividing results are evaluated by the. We prove that optimization on local  enables us to obtain maximal global weighted modularity w Q , which corresponds to the correct communities. For a weighted network with m edges and c communities, the weighted co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 29 publications
(47 reference statements)
0
1
0
Order By: Relevance
“…The result of such algorithm is that the total edge weights within a community is typically significantly smaller (if small value of edge weight indicates stronger connection) than that of edges connecting different communities (see e.g. Lu et al (2013), Shen et al (2016) and Palowitch et al (2017)).…”
Section: Centroid-based Community Detectionmentioning
confidence: 99%
“…The result of such algorithm is that the total edge weights within a community is typically significantly smaller (if small value of edge weight indicates stronger connection) than that of edges connecting different communities (see e.g. Lu et al (2013), Shen et al (2016) and Palowitch et al (2017)).…”
Section: Centroid-based Community Detectionmentioning
confidence: 99%