Abstract

To fully characterize the evolution process of the topological structure of dynamic communities, we propose a dynamic community detection based on Evolutionary DeepWalk (DEDW) for the high-dimensional data and dynamic characteristics. First, DEDW solves the problem of data sparseness in the process of dynamic network data representation through graph embedding. Then, DEDW uses the DeepWalk algorithm to generate node embedding feature vectors based on the characteristics of the stable change of the community structure; finally, DEDW integrates historical network structure information to generate evolutionary graph features and implements dynamic community detection with the K-means algorithm. Experiments show that DEDW can mine the time-smooth change characteristics of dynamic communities, solve the problem of data sparseness in the process of node embedding, fully consider historical structure information, and improve the accuracy and stability of dynamic community detection.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call