Yazhuo Gao

Yazhuo Gao

Auto-generated profile, based on publicly available information

Yazhuo Gao

PLA Academy of Military Sciences, Beijing, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
21 October 2021 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
YGYazhuo Gao
Yazhuo Gao
GZGuomin Zhang
Guomin Zhang
CXChangyou Xing
Changyou Xing
As an important deception defense method, a honeypot can be used to enhance the network’s active defense capability effectively. However, the existing rigid deployment method makes it difficult to deal with the uncertain strategic attack behaviors of the attackers. To solve such a problem, we propose a multiphase dynamic deployment mechanism of virtualized honeypots (MD2VH) based on the intelligent attack path prediction method. MD2VH depicts the attack and defense characteristics of both attackers and defenders through the Bayesian state attack graph, establishes a multiphase dynamic deployment optimization model of the virtualized honeypots based on the extended Markov’s decision-making process, and generates the deployment strategies dynamically by combining the online and offline reinforcement learning methods. Besides, we also implement a prototype system based on software-defined network and virtualization container, so as to evaluate the effectiveness of MD2VH. Experiments results show that the capture rate of MD2VH is maintained at about 90% in the case of both simple topology and complex topology. Compared with the simple intelligent deployment strategy, such a metric is increased by 20% to 60%, and the result is more stable under different types of the attacker’s strategy.

11 April 2025 in Computers & Security
Verified
Journal Article
Closed access
YGYazhuo Gao
Yazhuo Gao
LYLin Yang
Lin Yang
RZRan Zhu
Ran Zhu
YWYixuan Wu
Yixuan Wu
FYFeng Yang
Feng Yang
YCYining Cao
Yining Cao

30 June 2026 in Proceedings of the ACM on Software Engineering
Verified
Journal Article
Open access
YGYazhuo Gao
Yazhuo Gao
LYLin Yang
Lin Yang
LMLianxiao Meng
Lianxiao Meng
RZRan Zhu
Ran Zhu
YCYining Cao
Yining Cao
In large-scale microservice systems, multi-root-cause failures often intertwine, significantly increasing overall system risk and triggering a deluge of cascading alerts that pose serious challenges to fault diagnosis and recovery. Existing root-cause localization techniques remain largely passive, relying on rule-based pattern recognition or graph-based propagation inference, and thus falter when faced with the complexity of multi–root-cause failures. To address these challenges, this paper introduces a novel active-intervention-based framework for root-cause localization. This framework uses Hierarchical Reinforcement Learning (HRL) to infer root causes and employs an Intervention-enhanced Graph ATtention network (IGAT) to predict the fault scenarios each cause may trigger. By iteratively comparing these predicted scenarios against the system’s real-time state, the framework dynamically refines its localization model. Experimental results on two public datasets and a constructed dataset show that our method outperforms the second-best method by at least 22% on the PR@1 metric in single root cause scenarios and leads by 51.7% on the RE@3 metric in multiple root cause scenarios. These results indicate that the method may offer certain advantages in the field of fault root cause analysis.

1 May 2025 in TechRxiv
Verified
Preprint
Open access
YGYazhuo Gao
Yazhuo Gao
LYLin Yang
Lin Yang
RZRan Zhu
Ran Zhu
YWYixuan Wu
Yixuan Wu
YCYining Cao
Yining Cao
With the rapid advancement of computer network technologies, the complexity of cybersecurity issues has grown significantly. Anomaly detection as a critical role of defense against cyberattacks, play an essential role in safeguarding network security. However, traditional Anomaly detection methods often struggle to address few-shot scenarios. To overcome this limitation, an adaptive anomaly detection method for few-shot scenarios, RL-FAD (Reinforcement Learning-based Filter for Anomaly Detection), has been proposed. This method leverages causal feature selection and reinforcement learning to enhance detection performance. RL-FAD begins by efficiently and accurately identifying an optimal subset of features that predict target variables through a causality-based conditional test and a Markov blanket search algorithm. It then utilizes a tree model to transform the selected feature vectors, constructing a reinforcement learning environment that adheres to the Markov decision process. A Deep Q-Network (DQN) algorithm is subsequently employed to handle classification decisions. Experimental results demonstrate that RL-FAD can dynamically adjust its classification decisions in response to evolving attack patterns. The method was evaluated on three datasets—CIC-IDS2017, CIC-DDoS2019, and CIC-UNSW-NB15—achieving exceptional performance. Notably, even with only 100 training samples, RL-FAD achieved anomaly detection accuracies of 95%, 96%, and 94% on test datasets containing 50,000 samples, respectively. These results underscore RL-FAD’s robust detection capabilities and significant practical value in enhancing network security.