Yu Zheng

Yu Zheng

Auto-generated profile, based on publicly available information

Yu Zheng

Griffith University, Gold Coast, Australia

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
14 November 2023 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
YZYu Zheng
Yu Zheng
HKHuan Yee Koh
Huan Yee Koh
MJMing Jin
Ming Jin
Lianhua ChiLianhua Chi
Lianhua Chi
KPKhoa Phan
Khoa Phan
Wei XiangWei Xiang
Wei Xiang
Multivariate time-series anomaly detection is critically important in many applications, including retail, transportation, power grid, and water treatment plants. Existing approaches for this problem mostly employ either statistical models which cannot capture the nonlinear relations well or conventional deep learning (DL) models e.g., convolutional neural network (CNN) and long short-term memory (LSTM) that do not explicitly learn the pairwise correlations among variables. To overcome these limitations, we propose a novel method, correlation-aware spatial–temporal graph learning (termed ), for time-series anomaly detection. explicitly captures the pairwise correlations via a correlation learning (MTCL) module based on which a spatial–temporal graph neural network (STGNN) can be developed. Then, by employing a graph convolution network (GCN) that exploits one-and multihop neighbor information, our STGNN component can encode rich spatial information from complex pairwise dependencies between variables. With a temporal module that consists of dilated convolutional functions, the STGNN can further capture long-range dependence over time. A novel anomaly scoring component is further integrated into to estimate the degree of an anomaly in a purely unsupervised manner. Experimental results demonstrate that can detect and diagnose anomalies effectively in general settings as well as enable early detection across different time delays. Our code is available at https://github.com/huankoh/CST-GL.

12 April 2024 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
WLWei Lan
Wei Lan
CLChunling Li
Chunling Li
Qingfeng ChenQingfeng Chen
Qingfeng Chen
NYNing Yu
Ning Yu
YPYi Pan
Yi Pan
Yi-Ping Phoebe ChenYi-Ping Phoebe Chen
Yi-Ping Phoebe Chen
CircRNA has been shown to be involved in the occurrence of many diseases. Several computational frameworks have been proposed to identify circRNA-disease associations. Despite the existing computational methods have obtained considerable successes, these methods still require to be improved as their performance may degrade due to the sparsity of the data and the problem of memory overflow. We develop a novel computational framework called LGCDA to predict circRNA-disease associations by fusing local and global features to solve the above mentioned problems. First, we construct closed local subgraphs by using k-hop closed subgraph and label the subgraphs to obtain rich graph pattern information. Then, the local features are extracted by using graph neural network (GNN). In addition, we fuse Gaussian interaction profile (GIP) kernel and cosine similarity to obtain global features. Finally, the score of circRNA-disease associations is predicted by using the multilayer perceptron (MLP) based on local and global features. We perform five- fold cross validation on five datasets for model evaluation and our model surpasses other advanced methods. The code is available at https://github.com/lanbiolab/LGCDA

28 August 2021 in Chemistry & Biodiversity
Verified
Journal Article
Closed access
PDF file
XLXin‐Xin Lu
Xin‐Xin Lu
YFYi‐Xi Feng
Yi‐Xi Feng
YDYue‐Shen Du
Yue‐Shen Du
YZYu Zheng
Yu Zheng
ABAlmaz Borjigidai
Almaz Borjigidai
SDshushan Du
shushan Du

13 May 2024
Verified
Conference Paper
Open access
XNXuelian Ni
Xuelian Ni
FXFei Xiong
Fei Xiong
YZYu Zheng
Yu Zheng
LWLiang Wang
Liang Wang
Contrastive learning (CL) has recently catalyzed a productive avenue of research for recommendation. The efficacy of most CL methods for recommendation may hinge on their capacity to learn representation uniformity by mapping the data onto a hypersphere. Nonetheless, applying contrastive learning to downstream recommendation tasks remains challenging, as existing CL methods encounter difficulties in capturing the nonlinear dependence of representations in high-dimensional space and struggle to learn hierarchical social dependency among users-essential points for modeling user preferences. Moreover, the subtle distinctions between the augmented representations render CL methods sensitive to noise perturbations. Inspired by the Hilbert-Schmidt independence criterion (HSIC), we propose a graph Contrastive Learning model with Kernel Dependence Maximization CL-KDM for social recommendation to address these challenges. Specifically, to explicitly learn the kernel dependence of representations and improve the robustness and generalization of recommendation, we maximize the kernel dependence of augmented representations in kernel Hilbert space by introducing HSIC into the graph contrastive learning. Additionally, to simultaneously extract the hierarchical social dependency across users while preserving underlying structures, we design a hierarchical mutual information maximization module for generating augmented user representations, which are injected into the message passing of a graph neural network to enhance recommendation. Extensive experiments are conducted on three social recommendation datasets, and the results indicate that CL-KDM outperforms various baseline recommendation methods.

10 November 2025
Verified
Conference Paper
Open access
YZYunfeng Zhao
Yunfeng Zhao
YLYixin Liu
Yixin Liu
SLShiyuan Li
Shiyuan Li
Qingfeng ChenQingfeng Chen
Qingfeng Chen
YZYu Zheng
Yu Zheng
SPShirui Pan
Shirui Pan

8 January 2020 in IEEE Access
Verified
Journal Article
Open access
MJMing Jin
Ming Jin
MLMei Li
Mei Li
YZYu Zheng
Yu Zheng
Lianhua ChiLianhua Chi
Lianhua Chi
Mining the correlation has attracted widespread attention in the research community because of its advantages in understanding the dependencies between objects. In this paper, a correlated graph pattern searching scheme has been proposed, that is, provided with a query g as a structured pattern (i.e., a graph), our algorithm is capable of retrieving the top-k graphs that most likely correlated with g. Traditional methods treat graph streams as static records, which is computational infeasible or ineffective because of the complexity of searching correlated patterns in a dynamic graph stream. In this paper, by relying on sliding windows to separate graph streams in chunks, we propose a Hoe-PGPL algorithm to handle the top-k correlated patterns searching from a dynamic perspective. Our algorithm applies Hoeffding bound and two-level (Sliding window level and local batch level) candidate inspection to discover potential graph candidates and determine the similarity of these candidates without double-checking the previous stream. Theoretical analysis shows that our method can guarantee the quality of the returned answers, and our experiments also present that Hoe-PGPL has an excellent performance with aspects of precision, recall, runtime, and resource consumption.