Deyu Yuan

Dr. Deyu Yuan


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
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.

1 January 2023 in Computer Systems Science and Engineering
Verified
Journal Article
Open access
PDF file
SSShaofan Su
Shaofan Su
DYDeyu Yuan
Deyu Yuan
YWYuanxin Wang
Yuanxin Wang
MDMeng Ding
Meng Ding
With the rapid development of Internet technology, the type of information in the Internet is extremely complex, and a large number of riot contents containing bloody, violent and riotous components have appeared. These contents pose a great threat to the network ecology and national security. As a result, the importance of monitoring riotous Internet activity cannot be overstated. Convolutional Neural Network (CNN-based) target detection algorithm has great potential in identifying rioters, so this paper focused on the use of improved backbone and optimization function of You Only Look Once v5 (YOLOv5), and further optimization of hyperparameters using genetic algorithm to achieve fine-grained recognition of riot image content. First, the fine-grained features of riot-related images were identified, and then the dataset was constructed by manual annotation. Second, the training and testing work was carried out on the constructed dedicated dataset by supervised deep learning training. The research results have shown that the improved YOLOv5 network significantly improved the fine-grained feature extraction capability of riot-related images compared with the original YOLOv5 network structure, and the mean average precision (mAP) value was improved to 0.6128. Thus, it provided strong support for combating riot-related organizations and maintaining the online ecological environment.

1 January 2021 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
SCShicong Chen
Shicong Chen
DYDeyu Yuan
Deyu Yuan
SHShuhua Huang
Shuhua Huang
YCYang Chen
Yang Chen
The goal of network representation learning is to extract deep‐level abstraction from data features that can also be viewed as a process of transforming the high‐dimensional data to low‐dimensional features. Learning the mapping functions between two vector spaces is an essential problem. In this paper, we propose a new similarity index based on traditional machine learning, which integrates the concepts of common neighbor, local path, and preferential attachment. Furthermore, for applying the link prediction methods to the field of node classification, we have innovatively established an architecture named multitask graph autoencoder. Specifically, in the context of structural deep network embedding, the architecture designs a framework of high‐order loss function by calculating the node similarity from multiple angles so that the model can make up for the deficiency of the second‐order loss function. Through the parameter fine‐tuning, the high‐order loss function is introduced into the optimized autoencoder. Proved by the effective experiments, the framework is generally applicable to the majority of classical similarity indexes.

8 July 2022
Verified
Book Chapter
Closed access
PDF file
NYNaifu Ye
Naifu Ye
DYDeyu Yuan
Deyu Yuan
YMYuyan Meng
Yuyan Meng
MDMeng Ding
Meng Ding

4 July 2022
Verified
Book Chapter
Closed access
PDF file
WYWang Yuanxin
Wang Yuanxin
DYDeyu Yuan
Deyu Yuan
YMYuyan Meng
Yuyan Meng
DMDing Meng
Ding Meng

30 June 2022 in KSII Transactions on Internet and Information Systems
Verified
Journal Article
Closed access
YMYuyan Meng
Yuyan Meng
DYDeyu Yuan
Deyu Yuan
SSShaofan Su
Shaofan Su
YMYang Ming
Yang Ming
KSII Transactions on Internet and Information Systems TIIS Paper Details