Jizhao Liu

Dr. Jizhao Liu


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
5 November 2025 in Information
Verified
Journal Article
Open access
PDF file
JLJizhao Liu
Jizhao Liu
明方明艳 方
明艳 方
SZShuqin Zhang
Shuqin Zhang
FSFangfang Shan
Fangfang Shan
JLJun Li
Jun Li
Anomaly detection is a critical approach for ensuring the security of microservice systems. In recent years, deep sequence models have been widely applied to transform sequence modeling into a language modeling problem. However, the objective of training sequence models with language modeling loss is not directly aligned with anomaly detection. Moreover, the diverse data types in microservice systems—namely metrics, logs, and traces—exhibit asynchrony and complex interdependencies. Existing methods based on deep sequence models, such as LogBERT and TranAD, can only account for a limited number of data modalities, failing to fully utilize multi-source data and effectively handle the interrelationships among multiple modalities. To address this, we propose a multimodal anomaly detection framework based on a generative pre-trained language model (GPT), named GSTGPT. GSTGPT represents multi-source data as a feature graph, with metrics and logs as node features and traces as edge features. Additionally, we model feature interactions and dependencies within sequences using spatio-temporal attention and enhance the model’s focus on critical features through feature augmentation. Experimental results on two real-world datasets demonstrate that GSTGPT achieves an F1 score of 0.967, an 8.3% improvement over baseline methods, significantly outperforming them.

2 March 2026 in Information
Verified
Journal Article
Open access
PDF file
JLJizhao Liu
Jizhao Liu
ZZZiTao Zhang
ZiTao Zhang
SZShuqin Zhang
Shuqin Zhang
FSFangfang Shan
Fangfang Shan
JLJun Li
Jun Li
Advanced Persistent Threats (APTs) are characterized by stealth, infrequency, and long cycles, evading traditional security to endanger critical infrastructure. Complex semantic links between system entities can be accurately modeled using representation learning techniques based on heterogeneous provenance graphs, providing a novel method for uncovering hidden APT attack chains. However, in large-scale practical implementations, this approach still faces three major challenges: combinatorial explosion of long-range meta-paths, loss of semantic evolution during graph compression, and high computational overhead for dynamic environments. To address these, we propose APT-LMSPS, a detection system leveraging Long-Range Meta-path Progressive Sampling Search (LMSPS). The LMSPS algorithm uses dynamic pruning and semantic contribution assessment to convert meta-path combination explosion into constant-scale computation, accurately modeling long-range dependencies. Second, the Maintaining Global Semantics (MGS) approach intelligently filters events by tracking node semantic state changes, achieving an 8:1 compression ratio while preserving over 90% of critical pathways’ semantic integrity. Lastly, the meta-path encoding database uses a caching approach to avoid repeated encoding, doubling encoding effectiveness and enabling efficient, accurate, system-wide APT detection in large-scale scenarios. Evaluated on DARPA, StreamSpot, and ATLAS datasets, APT-LMSPS maintains competitive accuracy (F1-score ≥ 0.98) and improves long-range processing efficiency by an order of magnitude over baselines.

27 April 2026 in Information
Verified
Journal Article
Open access
PDF file
JLJizhao Liu
Jizhao Liu
硕毛硕 毛
硕 毛
SZShuqin Zhang
Shuqin Zhang
FSFangfang Shan
Fangfang Shan
JLJun Li
Jun Li
Due to the capability of graph structures to model complex relationships, graph anomaly detection has significant application value in various domains, including financial fraud detection, network security, and fake account identification. Traditional graph anomaly detection methods follow a specialized paradigm of “one dataset, one model”, which requires retraining or fine-tuning models for each new domain. This approach faces critical challenges in practical applications, namely high deployment costs and limited generalization capability. To address this problem, generalist graph anomaly detection aims to achieve the goal of “train once, apply across domains”. However, existing generalist methods primarily rely on graph neural networks to implicitly learn structural information, where the learned structural representations are tightly coupled with specific topology distributions, resulting in limited structural stability under domain shifts. To address this limitation, we propose DualGAD, a generalist graph anomaly detection method via a dual-encoder architecture. In particular, DualGAD introduces explicit structural modeling that characterizes the relative topological deviation of nodes with respect to the overall graph structure, thereby enhancing structural invariance across heterogeneous domains. This method separately models node attribute information and explicit graph structural information via an attribute feature encoder and an explicit structural feature encoder, and adopts an “attribute-dominant, structure-complementary” fusion strategy to achieve collaborative modeling. Experiments on eight real datasets demonstrate that DualGAD achieves an average improvement of 3.12% in AUROC compared to the strongest baseline methods, exhibiting significant cross-domain generalization capability.

17 February 2026 in Evolving Systems
Verified
Journal Article
Closed access
PDF file
SZShuqin Zhang
Shuqin Zhang
DWDashuang Wang
Dashuang Wang
YXYuanqing Xia
Yuanqing Xia
HZHui Zhao
Hui Zhao
JLJizhao Liu
Jizhao Liu