2015
DOI: 10.17706/jsw.10.7.825-834
|View full text |Cite
|
Sign up to set email alerts
|

A Fast Method of Detecting Overlapping Community in Network Based on LFM

Abstract: Detect overlapping communities efficiently and effectively in various social networks has been more and more important. Aiming at the high complexity of expanding strategy and the defect of generating many homeless nodes in LFM, we propose a quick algorithm based on local optimization of a fitness function(QLFM). The proposed algorithm firstly select a node as seed randomly .With a local fitness function ,the algorithm then will expand from inside to outside of the seed according to the Breadth-First-Search in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 20 publications
0
2
0
Order By: Relevance
“…Given a seed community, if all other vertexes can try to join to it, but not only those not joined to any community yet, this strategy can be used for the detection of overlapping communities. The algorithms IS(Iterative Scan) [28], RaRe(Rank Removal) [28], IS 2 (Improved IS) [29], LFM [30], fast LFM [31], DOCS(Detecting Overlapping Community Structures) [32], MOSES(Model-based Overlapping Seed Expan-Sion) [33], and OSLOM(Order Statistics Local Optimization Method) [34] are just some examples. However, the results of such an algorithm heavily depends on the quality of the selected seeds.…”
Section: Local Expansionmentioning
confidence: 99%
“…Given a seed community, if all other vertexes can try to join to it, but not only those not joined to any community yet, this strategy can be used for the detection of overlapping communities. The algorithms IS(Iterative Scan) [28], RaRe(Rank Removal) [28], IS 2 (Improved IS) [29], LFM [30], fast LFM [31], DOCS(Detecting Overlapping Community Structures) [32], MOSES(Model-based Overlapping Seed Expan-Sion) [33], and OSLOM(Order Statistics Local Optimization Method) [34] are just some examples. However, the results of such an algorithm heavily depends on the quality of the selected seeds.…”
Section: Local Expansionmentioning
confidence: 99%
“…Given a seed community, if all other vertexes can try to join into it, but not only those not joined into any community yet, this strategy can be used for the detection of overlapping communities. The algorithms IS(Iterative Scan) [15], RaRe(Rank Removal) [15], IS 2 (Improved IS) [16], LFM [17], fast LFM [18], DOCS(Detecting Overlapping Community Structures) [19], MOSES(Model-based Overlapping Seed ExpanSion) [20], and OSLOM(Order Statistics Local Optimization Method) [21] are just some examples. However, the results of such an algorithm heavily depends on the quality of the selected seeds.…”
Section: B Local Expansionmentioning
confidence: 99%