2022
DOI: 10.1109/tcyb.2021.3071542
|View full text |Cite
|
Sign up to set email alerts
|

NeSiFC: Neighbors’ Similarity-Based Fuzzy Community Detection Using Modified Local Random Walk

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
6
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 53 publications
0
6
0
Order By: Relevance
“…We use Python to implement the Algorithm 2 in this paper and select some classic network community detection algorithms and clear network community detection algorithms, such as GN [35] and D&L [39]. In addition, some advanced fuzzy network community detection algorithms are also used for comparisons, such as OCD [22] and NeSiFC [40].…”
Section: Experimental Results and Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…We use Python to implement the Algorithm 2 in this paper and select some classic network community detection algorithms and clear network community detection algorithms, such as GN [35] and D&L [39]. In addition, some advanced fuzzy network community detection algorithms are also used for comparisons, such as OCD [22] and NeSiFC [40].…”
Section: Experimental Results and Analysismentioning
confidence: 99%
“…It does not need to determine the partition number. In [40], the author used it to calculate the Karate Club network had a maximum modularity value of 0.372. As you can see, our network algorithm obtains a higher modularity value than other algorithms.…”
Section: Experimental Results and Analysismentioning
confidence: 99%
“…4) Fuzzy agglomerative approach (e.g., FuzAg [17], Ne-SiFC [14]) usually merges small groups of nodes or even single node successively according to the similarity of neighbors. Such methods do not require the number of communities or other network prior information, but usually require effective similarity metrics and fuzzy membership calculation methods.…”
Section: Problem Formulation Of Fuzzy Community Detectionmentioning
confidence: 99%
“…Fuzzy community detection (FCD) can quantify the partial belongingness of a node to multiple communities, thus providing richer community structure information in a more fine-grained manner [13,14]. Specifically, FCD measures the belonging degree of each node to multi communities, named membership grade [15], which is valued in the continuous range of [0,1].…”
mentioning
confidence: 99%
“…The label propagation algorithm (LPA) [17][18] has approximately linear time complexity. On the other hand, outcomes observed from community detection are regularly in volatile.Roy U K proposed a modified local random walk method to catch the fuzzy community based on neighbors' similarity [19]. Xiaodong Li surveys recent theoretical advances in convex optimization approaches for community detection [20].…”
Section: Introductionmentioning
confidence: 99%