You-Feng Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
You-Feng Zhao has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Feng Hu
School of Computer, Qinghai Normal University, Xining 810008, China
3 shared publications - Yurong Song
College of Automation, Nanjing University of Posts and Telecommunications, Nanjing 210023, China
3 shared publications - Pengyue Li
School of Computer, Qinghai Normal University, Xining 810008, China
2 shared publications - Dong Li
School of Airspace Science and Engineering, Shandong University, Weihai, Shandong, China, Shenzhen Research Institute of Shandong University, Shandong University, Shenzhen, Guangdong, China, and Shandong Key Laboratory of Intelligent Electronic Packaging Testing and Application, Shandong University, Weihai, Shandong, China
1 shared publication - Faxu Li
School of Computer, Qinghai Normal University , Xining 810008, Qinghai
1 shared publication - Fei Wu
Nanjing University of Posts and Telecommunications
1 shared publication
Latest Publications
- 1 October 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 353
HIC-DRL: A deep reinforcement learning approach for hypergraph influence maximization with independent cascade model
- 1 October 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 353
HIC-DRL: A deep reinforcement learning approach for hypergraph influence maximization with independent cascade model
- Open Access
- 9 April 2026
- Published by MDPI AG in Electronics
- Vol. 15 (8) , 1570
Encrypted Traffic Detection via a Federated Learning-Based Multi-Scale Feature Fusion Framework
With the proliferation of edge computing in IoT and smart security, there is a growing demand for large-scale encrypted traffic anomaly detection. However, the opaque nature of encrypted traffic makes it difficult for traditional detection methods to balance efficiency and accuracy. To address this challenge, this paper proposes FMTF, a Multi-Scale Feature Fusion method based on Federated Learning for encrypted traffic anomaly detection. FMTF constructs graph structures at three scales—spatial, statistical, and content—to comprehensively characterize traffic features. At the spatial scale, communication graphs are constructed based on host-to-host IP interactions, where each node represents the IP address of a host and edges capture the communication relationships between them. The statistical scale builds traffic statistic graphs based on interactions between port numbers, with nodes representing individual ports and edge weights corresponding to the lengths of transmitted packets. At the content scale, byte-level traffic graphs are generated, where nodes represent pairs of bytes extracted from the traffic data, and edges are weighted using pointwise mutual information (PMI) to reflect the statistical association between byte occurrences. To extract and fuse these multi-scale features, FMTF employs the Graph Attention Network (GAT), enhancing the model’s traffic representation capability. Furthermore, to reduce raw-data exposure in distributed edge environments, FMTF integrates a federated learning framework. In this framework, edge devices train models locally based on their multi-scale traffic features and periodically share model parameters with a central server for aggregation, thereby optimizing the global model without exposing raw data. Experimental results demonstrate that FMTF maintains efficient and accurate anomaly detection performance even under limited computing resources, offering a practical and effective solution for encrypted traffic identification and network security protection in edge computing environments.
- 9 April 2026
- Published by MDPI AG in Electronics
- Vol. 15 (8) , 1570
Open AccessEncrypted Traffic Detection via a Federated Learning-Based Multi-Scale Feature Fusion Framework
With the proliferation of edge computing in IoT and smart security, there is a growing demand for large-scale encrypted traffic anomaly detection. However, the opaque nature of encrypted traffic makes it difficult for traditional detection methods to balance efficiency and accuracy. To address this challenge, this paper proposes FMTF, a Multi-Scale Feature Fusion method based on Federated Learning for encrypted traffic anomaly detection. FMTF constructs graph structures at three scales—spatial, statistical, and content—to comprehensively characterize traffic features. At the spatial scale, communication graphs are constructed based on host-to-host IP interactions, where each node represents the IP address of a host and edges capture the communication relationships between them. The statistical scale builds traffic statistic graphs based on interactions between port numbers, with nodes representing individual ports and edge weights corresponding to the lengths of transmitted packets. At the content scale, byte-level traffic graphs are generated, where nodes represent pairs of bytes extracted from the traffic data, and edges are weighted using pointwise mutual information (PMI) to reflect the statistical association between byte occurrences. To extract and fuse these multi-scale features, FMTF employs the Graph Attention Network (GAT), enhancing the model’s traffic representation capability. Furthermore, to reduce raw-data exposure in distributed edge environments, FMTF integrates a federated learning framework. In this framework, edge devices train models locally based on their multi-scale traffic features and periodically share model parameters with a central server for aggregation, thereby optimizing the global model without exposing raw data. Experimental results demonstrate that FMTF maintains efficient and accurate anomaly detection performance even under limited computing resources, offering a practical and effective solution for encrypted traffic identification and network security protection in edge computing environments.
- Open Access
- 27 August 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (17) , 2751
Constrained Optimal Control of Information Diffusion in Online Social Hypernetworks
With the rapid development of online social networks, issues related to information security and public opinion control have increasingly attracted widespread attention. Therefore, this study establishes a constrained optimal control framework for information diffusion in online social networks, based on the (Susceptible Inactive–Susceptible Active–Exposed–Informed–Recovered) information diffusion model on social hypernetworks. This framework incorporates both cost and triggering constraints, with the goal of optimally regulating the information diffusion process through dynamic intervention strategies. The existence and uniqueness of the optimal solution are theoretically proven, and the corresponding optimal control strategy is derived. The effectiveness and generality of the model are demonstrated through experiments, and the impact of different combinations of control strategies on system performance enhancement is investigated. The results indicate that the proposed control framework can significantly improve system control effectiveness while satisfying all imposed constraints and exhibits strong generalizability. Not only does this study enrich the theoretical foundation of information diffusion control, but it also provides practical theoretical support for addressing real-world issues such as public opinion guidance and commercial marketing in online social networks.- 27 August 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (17) , 2751
Open AccessConstrained Optimal Control of Information Diffusion in Online Social Hypernetworks
With the rapid development of online social networks, issues related to information security and public opinion control have increasingly attracted widespread attention. Therefore, this study establishes a constrained optimal control framework for information diffusion in online social networks, based on the (Susceptible Inactive–Susceptible Active–Exposed–Informed–Recovered) information diffusion model on social hypernetworks. This framework incorporates both cost and triggering constraints, with the goal of optimally regulating the information diffusion process through dynamic intervention strategies. The existence and uniqueness of the optimal solution are theoretically proven, and the corresponding optimal control strategy is derived. The effectiveness and generality of the model are demonstrated through experiments, and the impact of different combinations of control strategies on system performance enhancement is investigated. The results indicate that the proposed control framework can significantly improve system control effectiveness while satisfying all imposed constraints and exhibits strong generalizability. Not only does this study enrich the theoretical foundation of information diffusion control, but it also provides practical theoretical support for addressing real-world issues such as public opinion guidance and commercial marketing in online social networks. - 21 July 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 508
SEIAR rumor spreading model with antagonistic states in hypernetworks
- 21 July 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 508
SEIAR rumor spreading model with antagonistic states in hypernetworks