2016
DOI: 10.1016/j.neucom.2016.05.020
|View full text |Cite
|
Sign up to set email alerts
|

LED: A fast overlapping communities detection algorithm based on structural clustering

Abstract: Community detection in social networks is a fundamental task of complex network analysis. Community is usually regarded as a functional unit. Networks in real world more or less have overlapping community structure while traditional community detection algorithms assume that one vertex can only belong to one community. This paper proposes an efficient overlapping community detection algorithm named LED (Loop Edges Delete). LED algorithm is based on Structural Clustering, which converts structural similarity be… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
17
0

Year Published

2017
2017
2018
2018

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 82 publications
(17 citation statements)
references
References 42 publications
0
17
0
Order By: Relevance
“…And machine learning classification model [ 27 – 29 ] such as the state-of-art v-support vector machine methods [ 30 32 ], dimension reduction techniques [ 33 35 ], neural-like computing models [ 36 38 ] and spiking neural networks [ 39 , 40 ] could be tested. Community detection methods, especially overlapping communities detection [ 41 ] also can be considered for the further improvement.…”
Section: Discussionmentioning
confidence: 99%
“…And machine learning classification model [ 27 – 29 ] such as the state-of-art v-support vector machine methods [ 30 32 ], dimension reduction techniques [ 33 35 ], neural-like computing models [ 36 38 ] and spiking neural networks [ 39 , 40 ] could be tested. Community detection methods, especially overlapping communities detection [ 41 ] also can be considered for the further improvement.…”
Section: Discussionmentioning
confidence: 99%
“…Ma et al [18] have presented a loop edges delete (LED) algorithm. It is an efficient detection algorithm used for finding overlapping communities in the network based on structural clustering.…”
Section: Related Workmentioning
confidence: 99%
“…Rong et al [45] proposed a novel K+-isomorphism method to achieve the K-anonymization state among subgraphs. Ma et al [46] proposed an efficient overlapping community detection algorithm based on structural clustering. Deng et al [47] proposed a novel collaborative optimization algorithm for solving complex problems.…”
Section: Related Workmentioning
confidence: 99%