Dechun Yin

Dechun Yin

Auto-generated profile, based on publicly available information

Dechun Yin

School of Information Network Security, People’s Public Security University of China, Beijing, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 March 2020 in IEEE Access
Verified
Journal Article
Open access
WLWenzheng Li
Wenzheng Li
YGYijun Gu
Yijun Gu
DYDechun Yin
Dechun Yin
TXTianyu Xia
Tianyu Xia
JWJingya Wang
Jingya Wang
Human activities are usually collective, so clustering has become an important feature of human behavior. This paper studied the evolution of the community in the process of public opinion propagation so as to put forward a public opinion evolution model for the network community number. This study proposed the community number evolution model of public opinion based on stochastic competitive learning, and the proposed model consists of an increase in the number of communities and a decrease in the number of communities. The highlight of this model is that on the one hand, it realizes the research on the evolution of public opinions on the dynamic network; on the other hand, unlike other public opinion evolution models, this model pays attention to the community number increase and decrease rules in the evolution of public opinions. Then, as an extension of the community number evolution model of public opinion, the community number prediction model had been proposed. Based on Twitter data from the 2017 London Bridge attack, the proposed models were validated by experiments. In the verification section of this paper, two methods had been introduced as a comparison. The experimental results show that the community number evolution model of public opinion is correct.

22 December 2020 in IEEE Access
Verified
Journal Article
Open access
TXTianyu Xia
Tianyu Xia
YGYijun Gu
Yijun Gu
DYDechun Yin
Dechun Yin
In the natural and social systems of the real world, various network can be seen everywhere. The world where people live can be seen as a combination of network with different dimensions. Link prediction formalizes the interaction behavior between people. Traditional link prediction methods mainly study the user behavior of static social network. This article studied the dynamic graph representation learning so as to put forward an improved link prediction model in dynamic social network. Besides, the interactions in the real world can be multiple, links at different moments may have different meanings. The proposed model firstly solved the problem of link prediction on multiple kinds of edges. The whole embedding of each node is separated into two parts, basic embedding and edge embedding. Then the proposed model selected time slices for dynamic social network to get the graph embeddings in different snapshots. What’s more, the $t+1$ time step embedding vector was used to validate $t$ time step prediction effect and the proposed model performed better than traditional graph representation learning methods.

30 July 2020 in IEEE Access
Verified
Journal Article
Open access
WLWenzheng Li
Wenzheng Li
DYDechun Yin
Dechun Yin
DYDeyu Yuan
Deyu Yuan
BWBenyu Wang
Benyu Wang
YGYijun Gu
Yijun Gu
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.