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

Research on Dynamic Community Detection Method Based on an Improved Pity Beetle Algorithm

Abstract: In the last decade, community detection in dynamic networks has received increasing attention, because it can not only uncover the community structure of the network at any time but also reveal the regularity of dynamic networks evolution. Although methods based on the framework of evolutionary clustering are promising for dynamic community detection, there is still room for further improvement in the snapshot quality and the temporal cost. In this study, a dynamic community detection algorithm based on option… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 56 publications
0
3
0
Order By: Relevance
“…We here reviewed a variety of initialization methods widely used in CD for complex networks. It is worth noting that there exist some competitive initializaiton methods for the CD, such as label propagation algorithm (LPA)-based initialization methods [34,35] and locus-based adjacency representation (LAR)-based initialization methods [1,20,36,37].…”
Section: Initialization Methods For the CDmentioning
confidence: 99%
See 1 more Smart Citation
“…We here reviewed a variety of initialization methods widely used in CD for complex networks. It is worth noting that there exist some competitive initializaiton methods for the CD, such as label propagation algorithm (LPA)-based initialization methods [34,35] and locus-based adjacency representation (LAR)-based initialization methods [1,20,36,37].…”
Section: Initialization Methods For the CDmentioning
confidence: 99%
“…Two strategies are utilized to improve the quality and diversity of the initial population. The first solutions are generated as the adjacent node-based initialization method [37]. In this initialization method, individual nodes are encoded using the neighboring node, which is selected randomly from the current node; then, the current node and its neighboring node are aggregated in the same community by decoding.…”
Section: Fast Elite Population Initializationmentioning
confidence: 99%
“…Te community detection methods change gradually with the increasing complexity of network data. Scholars always tend to develop community detection methods that can extract more and deeper useful information from the network to guide community division [24]. Currently available community detection algorithms are mainly designed for directed networks, undirected networks, and networks with weighted graphs, and they divide diferent communities by information provided by the network structure [25].…”
Section: Community Detectionmentioning
confidence: 99%