2019
DOI: 10.1155/2019/9764341
|View full text |Cite
|
Sign up to set email alerts
|

Effectively Detecting Communities by Adjusting Initial Structure via Cores

Abstract: Community detection is helpful to understand useful information in real-world networks by uncovering their natural structures. In this paper, we propose a simple but effective community detection algorithm, called ACC, which needs no heuristic search but has near-linear time complexity. ACC defines a novel similarity which is different from most common similarity definitions by considering not only common neighbors of two adjacent nodes but also their mutual exclusive degree. According to this similarity, ACC … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 40 publications
0
2
0
Order By: Relevance
“…On the other hand, authors such as Fortunato and Barthelemy [41] and Chen et al [43] have supposed that utilizing the algorithms depending on a particular criterion like the modularity do not suit the community detection problem. This is because these approaches will necessarily involve searching for the modules having large modularities.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…On the other hand, authors such as Fortunato and Barthelemy [41] and Chen et al [43] have supposed that utilizing the algorithms depending on a particular criterion like the modularity do not suit the community detection problem. This is because these approaches will necessarily involve searching for the modules having large modularities.…”
Section: Discussionmentioning
confidence: 99%
“…This has motivated recently proposing new approaches which are not based on the optimization such as the work of Chen et al [43] having near-linear time complexity and does not involve a heuristic search. Their simple proposed work utilizes a new similarity involving common neighbors of the 2 contiguous vertices as well as their mutual exclusive degree.…”
Section: Discussionmentioning
confidence: 99%