Particle Propagation Model for Dynamic Node Classification

doi:10.1109/ACCESS.2020.3013018

2020-01-01

DOI：10.1109/ACCESS.2020.3013018

原文链接

查看原文

摘要

En 中文

With the popularity of online social networks, researches on dynamic node classification have received further attention. Dynamic node classification also helps the rapid popularization of online social networks. This paper proposes a particle competition model named DPP to complete the dynamic node classification. Existing node classification models based on particle competition do not perform well in terms of accuracy. Hence, we formulate a unique particle competition framework to make the node classification more effective. In addition, for applying the model in the dynamic network, based on the dynamic characteristics of the model, we have added an automatic update strategy of the source node to the model. The particles in the new model perform the steps of walking, splitting, and jumping according to the method introduced in this paper. Then, the domination matrix of the network has been changed with particle movements continuously. Although the particles randomly walk at the micro-level, the model can converge to obtain the node classification results. Finally, simulation results show both the effectiveness and superiority of our proposed node classification model with the comparison of other major particle competition models and dynamic node classification methods. Based on the above contributions, the proposed model may have compelling applications in the context of community detection and network embedding, etc.

Keyword:

Heuristic algorithms

Legged locomotion

Computational modeling

Analytical models

Security

Complex networks

Semisupervised learning

Complex network

particle competition

dynamic node classification