Yuze Liu

Yuze Liu

Auto-generated profile, based on publicly available information

Yuze Liu

Ant Group, Shanghai, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
19 September 2023 in IEEE Transactions on Artificial Intelligence
Verified
Journal Article
Closed access
TZTIEHUA ZHANG
TIEHUA ZHANG
YLYuze Liu
Yuze Liu
Zhishu ShenZhishu Shen
Zhishu Shen
RXRui Xu
Rui Xu
XCXin Chen
Xin Chen
Xi ZhengXi Zheng
Xi Zheng
Spatial-temporal data contains rich information and has been widely studied in recent years due to the rapid development of relevant applications in many fields. For instance, medical institutions often use electrodes attached to different parts of a patient to analyse the electorencephal data rich with spatial and temporal features for health assessment and disease diagnosis. Existing research has mainly used deep learning techniques such as convolutional neural network (CNN) or recurrent neural network (RNN) to extract hidden spatial-temporal features. Yet, it is challenging to incorporate both inter-dependencies spatial information and dynamic temporal changes simultaneously. In reality, for a model that leverages these spatial-temporal features to fulfil complex prediction tasks, it often requires a colossal amount of training data in order to obtain satisfactory model performance. Considering the above-mentioned challenges, we propose an adaptive federated relevance framework, namely FedRel, for spatial-temporal graph learning in this paper. After transforming the raw spatial-temporal data into high-quality features, the core Dynamic Inter-Intra Graph (DIIG) module in the framework is able to use these features to generate the spatial-temporal graphs capable of capturing the hidden topological and long-term temporal correlation information in these graphs. To improve the model generalization ability and performance while preserving the local data privacy, we also design a relevance-driven federated learning module in our framework to leverage diverse data distributions from different participants with attentive aggregations of their models. In addition, we conduct extensive experiments on two real-world spatial-temporal datasets. The results demonstrate the effectiveness of our proposed framework in spatial-temporal interpretation, collaborative model training, and divergent data distribution handling in most settings of comparison.

3 January 2025 in IEEE Transactions on Artificial Intelligence
Verified
Journal Article
Closed access
TZTIEHUA ZHANG
TIEHUA ZHANG
YLYuze Liu
Yuze Liu
Zhishu ShenZhishu Shen
Zhishu Shen
XMXingjun Ma
Xingjun Ma
PQPeng Qi
Peng Qi
JJJiong Jin
Jiong Jin
Graph neural network (GNN) has gained increasing popularity in recent years owing to its capability and flexibility in modeling complex graph structure data. Among all graph learning methods, hypergraph learning is a technique for exploring the implicit higher-order correlations when training the embedding space of the graph. In this paper, we propose a hypergraph learning framework named Learning from Heterogeneity (LFH) that is capable of dynamic hyperedge construction and attentive embedding update utilizing the heterogeneity attributes of the graph. Specifically, in our framework, the high-quality features are first generated by the pairwise fusion strategy that utilizes explicit graph structure information when generating initial node embedding. Afterwards, a hypergraph is constructed through the dynamic grouping of implicit hyperedges, followed by the type-specific hypergraph learning process. To evaluate the effectiveness of our proposed framework, we conduct comprehensive experiments on several popular datasets with twelve state-of-the- art models on both node classification and link prediction tasks, which fall into categories of homogeneous pairwise graph learning, heterogeneous pairwise graph learning, and hypergraph learning. The experiment results demonstrate a significant performance gain (an average of 12.9% in node classification and 12.8% in link prediction) compared with recent state-of-the-art methods.

22 November 2024 in ACM Transactions on Software Engineering and Methodology
Verified
Journal Article
Open access
TZTIEHUA ZHANG
TIEHUA ZHANG
RXRui Xu
Rui Xu
JZJianping Zhang
Jianping Zhang
YLYuze Liu
Yuze Liu
XCXin Chen
Xin Chen
Xi ZhengXi Zheng
Xi Zheng
Vulnerability detection is a critical problem in software security and attracts growing attention both from academia and industry. Traditionally, software security is safeguarded by designated rule-based detectors that heavily rely on empirical expertise, requiring tremendous effort from software experts to generate rule repositories for large code corpus. Recent advances in deep learning, especially Graph Neural Networks (GNN), have uncovered the feasibility of automatic detection of a wide range of software vulnerabilities. However, prior learning-based works only break programs down into a sequence of word tokens for extracting contextual features of codes, or apply GNN largely on homogeneous graph representation (e.g., AST) without discerning complex types of underlying program entities (e.g., methods, variables). In this work, we are one of the first to explore heterogeneous graph representation in the form of Code Property Graph and adapt a well-known heterogeneous graph network with a dual-supervisor structure for the corresponding graph learning task. Using the prototype built, we have conducted extensive experiments on both synthetic datasets and real-world projects. Compared with the state-of-the-art baselines, the results demonstrate superior performance in vulnerability detection (average F1 improvements over 10% in real-world projects) and language-agnostic transferability from C/C \({+}{+}\) to other programming languages (average F1 improvements over 11%).