2020
DOI: 10.1007/s11432-020-2827-9
|View full text |Cite
|
Sign up to set email alerts
|

An evolutionary autoencoder for dynamic community detection

Abstract: Dynamic community detection is significant for controlling and capturing the temporal features of networks. The evolutionary clustering framework provides a temporal smoothness constraint for simultaneously maximizing the clustering quality at the current time step and minimizing the clustering deviation between two successive time steps. Based on this framework, some existing methods, such as the evolutionary spectral clustering and evolutionary nonnegative matrix factorization, aim to look for the low-dimens… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 34 publications
(13 citation statements)
references
References 42 publications
0
13
0
Order By: Relevance
“…To discover time-varying dynamic community structure, Semi-supervised Evolutionary Autoencoder (sE-Autoencoder) [96] is developed within an evolutionary clustering framework, assuming community structures at previous time steps successively guide the detection at the current time step. To this end, sE-Autoencoder adds a temporal smoothness regularization L(Z (t) , Z (t−1) ) into the objective function in [92] for minimization:…”
Section: A Stacked Ae-based Community Detectionmentioning
confidence: 99%
See 1 more Smart Citation
“…To discover time-varying dynamic community structure, Semi-supervised Evolutionary Autoencoder (sE-Autoencoder) [96] is developed within an evolutionary clustering framework, assuming community structures at previous time steps successively guide the detection at the current time step. To this end, sE-Autoencoder adds a temporal smoothness regularization L(Z (t) , Z (t−1) ) into the objective function in [92] for minimization:…”
Section: A Stacked Ae-based Community Detectionmentioning
confidence: 99%
“…Re-training over static network snapshots is not an ideal solution. In our literature review, only one study touches the topic by designing an evolutionary AE aiming at discovering smoothly changing community structure over snapshots [96]. Technical challenges in detecting a dynamic network focus on controlling the dynamics (i.e., spatial and temporal properties) in the model training process.…”
Section: K Dynamic Networkmentioning
confidence: 99%
“…In recommender systems, many classic collaborative filtering algorithms fall into the class of matrix factorization (MF) [28]. MF-based models project users and items into a low-dimensional latent space and represent a user or an item by a vector [29]. The inner product of a user vector and an item vector represents the user's satisfaction degree to the item.…”
Section: Mf-based Recommendationmentioning
confidence: 99%
“…Similarly, Wu et al [14] explored the impact of three different kinds of awareness on the epidemic spread in a scale-free networked population. However, single-layer networks provide a limited representation of complex systems [15][16][17]. The efforts in [13,14] may fail to involve the realistic scenario where the information and virus spread via different networks simultaneously.…”
Section: Introductionmentioning
confidence: 99%