Jie Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jie Wang has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Dongming Chen
Northeastern University, Shenyang, China
1 shared publication - Dongqi Wang
Northeastern University, Shenyang, China
1 shared publication - Mingshuo Nie
Northeastern University
1 shared publication - Xinyu Huang
Software College, Northeastern University of China, Shenyang, People’s Republic of China
1 shared publication - Yun Kong
Software College, Northeastern University, Shenyang 110169, China
1 shared publication
Latest Publications
- Open Access
- 14 May 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (10) , 4497
Community Detection Based on Graph Representation Learning in Evolutionary Networks
Aiming at analyzing the temporal structures in evolutionary networks, we propose a community detection algorithm based on graph representation learning. The proposed algorithm employs a Laplacian matrix to obtain the node relationship information of the directly connected edges of the network structure at the previous time slice, the deep sparse autoencoder learns to represent the network structure under the current time slice, and the K-means clustering algorithm is used to partition the low-dimensional feature matrix of the network structure under the current time slice into communities. Experiments on three real datasets show that the proposed algorithm outperformed the baselines regarding effectiveness and feasibility.
- 14 May 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (10) , 4497
Open AccessCommunity Detection Based on Graph Representation Learning in Evolutionary Networks
Aiming at analyzing the temporal structures in evolutionary networks, we propose a community detection algorithm based on graph representation learning. The proposed algorithm employs a Laplacian matrix to obtain the node relationship information of the directly connected edges of the network structure at the previous time slice, the deep sparse autoencoder learns to represent the network structure under the current time slice, and the K-means clustering algorithm is used to partition the low-dimensional feature matrix of the network structure under the current time slice into communities. Experiments on three real datasets show that the proposed algorithm outperformed the baselines regarding effectiveness and feasibility.