Affiliations: [a] College of Computer Science and Technology, Harbin Engineering University, Harbin, Heilongjiang, China
| [b] School of Computer Technology and Engineering, Changchun Institute of Technology, Changchun, Jilin, China
Correspondence:
[*]
Corresponding author. Jianpei Zhang, College of Computer Science and Technology, Harbin Engineering University, Harbin, 150001, Heilongjiang, China. E-mail: zhangjianpei@hrbeu.edu.cn.
Abstract: The problems caused by network dimension disasters and computational complexity have become an important issue to be solved in the field of social network research. The existing methods for network feature learning are mostly based on static and small-scale assumptions, and there is no modified learning for the unique attributes of social networks. Therefore, existing learning methods cannot adapt to the dynamic and large-scale of current social networks. Even super large scale and other features. This paper mainly studies the feature representation learning of large-scale dynamic social network structure. In this paper, the positive and negative damping sampling of network nodes in different classes is carried out, and the dynamic feature learning method for newly added nodes is constructed, which makes the model feasible for the extraction of structural features of large-scale social networks in the process of dynamic change. The obtained node feature representation has better dynamic robustness. By selecting the real datasets of three large-scale dynamic social networks and the experiments of dynamic link prediction in social networks, it is found that DNPS has achieved a large performance improvement over the benchmark model in terms of prediction accuracy and time efficiency. When the α value is around 0.7, the model effect is optimal.
Keywords: Feature learning, social network, representation learning, neural network
