Jiazhen Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jiazhen Chen has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Mingbin Feng
University of Waterloo
3 shared publications - Tony Suryanawata Wirjanto
University of Waterloo
3 shared publications - Sichao Fu
Huazhong University of Science and Technology
2 shared publications - Zheng Ma
University of Waterloo, Waterloo, ON, Canada
2 shared publications - Ali Ghodsi
University of Waterloo
1 shared publication Baodi Liu
1 shared publication
Latest Publications
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 11956-11965
Towards Effective Open-set Graph Class-incremental Learning
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 11956-11965
Open AccessTowards Effective Open-set Graph Class-incremental Learning
- 4 July 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 295
Multiplex graph prompt collaboration for open-set social event detection
- 4 July 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 295
Multiplex graph prompt collaboration for open-set social event detection
- Open Access
- 10 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 98-106
Prospective Multi-Graph Cohesion for Multivariate Time Series Anomaly Detection
Anomaly detection in high-dimensional time series data is pivotal for numerous industrial applications. Recent advances in multivariate time series anomaly detection (TSAD) have increasingly leveraged graph structures to model inter-variable relationships, typically employing Graph Neural Networks (GNNs). Despite their promising results, existing methods often rely on a single graph representation, which are insufficient for capturing the complex, diverse relationships inherent in multivariate time series. To address this, we propose the Prospective Multi-Graph Cohesion (PMGC) framework for multivariate TSAD. PMGC exploits spatial correlations by integrating a long-term static graph with a series of short-term instance-wise dynamic graphs, regulated through a graph cohesion loss function. Our theoretical analysis shows that this loss function promotes diversity among dynamic graphs while aligning them with the stable long-term relationships encapsulated by the static graph. Additionally, we introduce a "prospective graphing" strategy to mitigate the limitations of traditional forecasting-based TSAD methods, which often struggle with unpredictable future variations. This strategy allows the model to accurately reflect concurrent inter-series relationships under normal conditions, thereby enhancing anomaly detection efficacy. Empirical evaluations on real-world datasets demonstrate the superior performance of our method compared to existing TSAD techniques.
- 10 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 98-106
Open AccessProspective Multi-Graph Cohesion for Multivariate Time Series Anomaly Detection
Anomaly detection in high-dimensional time series data is pivotal for numerous industrial applications. Recent advances in multivariate time series anomaly detection (TSAD) have increasingly leveraged graph structures to model inter-variable relationships, typically employing Graph Neural Networks (GNNs). Despite their promising results, existing methods often rely on a single graph representation, which are insufficient for capturing the complex, diverse relationships inherent in multivariate time series. To address this, we propose the Prospective Multi-Graph Cohesion (PMGC) framework for multivariate TSAD. PMGC exploits spatial correlations by integrating a long-term static graph with a series of short-term instance-wise dynamic graphs, regulated through a graph cohesion loss function. Our theoretical analysis shows that this loss function promotes diversity among dynamic graphs while aligning them with the stable long-term relationships encapsulated by the static graph. Additionally, we introduce a "prospective graphing" strategy to mitigate the limitations of traditional forecasting-based TSAD methods, which often struggle with unpredictable future variations. This strategy allows the model to accurately reflect concurrent inter-series relationships under normal conditions, thereby enhancing anomaly detection efficacy. Empirical evaluations on real-world datasets demonstrate the superior performance of our method compared to existing TSAD techniques.
- 13 October 2024
- Published by American Chemical Society (ACS) in Journal of Proteome Research
- Vol. 23 (11) , 4821-4834
GraphPI: Efficient Protein Inference with Graph Neural Networks
The integration of deep learning approaches in biomedical research has been transformative, enabling breakthroughs in various applications. Despite these strides, its application in protein inference is impeded by the scarcity of extensively labeled data sets, a challenge compounded by the high costs and complexities of accurate protein annotation. In this study, we introduce GraphPI, a novel framework that treats protein inference as a node classification problem. We treat proteins as interconnected nodes within a protein-peptide-PSM graph, utilizing a graph neural network-based architecture to elucidate their interrelations. To address label scarcity, we train the model on a set of unlabeled public protein data sets with pseudolabels derived from an existing protein inference algorithm, enhanced by self-training to iteratively refine labels based on confidence scores. Contrary to prevalent methodologies necessitating data set-specific training, our research illustrates that GraphPI, due to the well-normalized nature of Percolator features, exhibits universal applicability without data set-specific fine-tuning, a feature that not only mitigates the risk of overfitting but also enhances computational efficiency. Our empirical experiments reveal notable performance on various test data sets and deliver significantly reduced computation times compared to common protein inference algorithms.
- 13 October 2024
- Published by American Chemical Society (ACS) in Journal of Proteome Research
- Vol. 23 (11) , 4821-4834
GraphPI: Efficient Protein Inference with Graph Neural Networks
The integration of deep learning approaches in biomedical research has been transformative, enabling breakthroughs in various applications. Despite these strides, its application in protein inference is impeded by the scarcity of extensively labeled data sets, a challenge compounded by the high costs and complexities of accurate protein annotation. In this study, we introduce GraphPI, a novel framework that treats protein inference as a node classification problem. We treat proteins as interconnected nodes within a protein-peptide-PSM graph, utilizing a graph neural network-based architecture to elucidate their interrelations. To address label scarcity, we train the model on a set of unlabeled public protein data sets with pseudolabels derived from an existing protein inference algorithm, enhanced by self-training to iteratively refine labels based on confidence scores. Contrary to prevalent methodologies necessitating data set-specific training, our research illustrates that GraphPI, due to the well-normalized nature of Percolator features, exhibits universal applicability without data set-specific fine-tuning, a feature that not only mitigates the risk of overfitting but also enhances computational efficiency. Our empirical experiments reveal notable performance on various test data sets and deliver significantly reduced computation times compared to common protein inference algorithms.