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

Overlapping communities from lines and triangles in complex networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…Gao et al 7 proposed VISM—a similarity‐based seeding approach that combines similarity and vertex influence to search for lines and triangles in the network and use its grain for discovering communities. Also, they removed the subgraphs; their size is smaller than a specific scale.…”
Section: Analysis Of Related Workmentioning
confidence: 99%
“…Gao et al 7 proposed VISM—a similarity‐based seeding approach that combines similarity and vertex influence to search for lines and triangles in the network and use its grain for discovering communities. Also, they removed the subgraphs; their size is smaller than a specific scale.…”
Section: Analysis Of Related Workmentioning
confidence: 99%
“…This kind of algorithms have a obvious shortcoming, that is, it has a large time complexity, resulting in a huge time cost. Compared with the global network algorithm, the local network algorithm does not need all the information of the network, and can only mine the local community division of the network from the local structure of the network, which effectively reduces the time cost 2 . This paper selects the local expansion function algorithm (LFM), and proposes an overlapping community detecion algorithm SCF-LFM, which improves the seed selection method and the community expansion method.…”
Section: Introductionmentioning
confidence: 99%