Yuchun Guo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Yuchun Guo has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Yishuai Chen
Beijing Jiaotong University
9 shared publications Yishuai Chen
Beijing Jiaotong University
7 shared publications- Jingjing Yang
School of Information and Electronic Engineering, Beijing Jiaotong University, Beijing, China
2 shared publications - Naipeng Li
School of Electronics and Information Engineering, Beijing Jiaotong University, Beijing 100044, P. R. China
2 shared publications - Tingting Feng
China Unicom Smart City Research Institute
2 shared publications Wei Zhu
2 shared publications
Latest Publications
- 21 March 2026
- Published by Elsevier in Information Fusion
- Vol. 133
SISSEL: Scale independent self-supervised representation learning for multivariate time series
- 21 March 2026
- Published by Elsevier in Information Fusion
- Vol. 133
SISSEL: Scale independent self-supervised representation learning for multivariate time series
- Open Access
- 8 November 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (22) , 12126
Hi-RCA: A Hierarchy Anomaly Diagnosis Framework Based on Causality and Correlation Analysis
Microservice architecture has been widely adopted by large-scale applications. Due to the huge amount of data and complex microservice dependency, it also poses new challenges in ensuring reliable performance and maintenance. Existing approaches still suffer from limitations of anomaly data, over-simplification of metric relationships, and lack of diagnosing interpretability. To solve these issues, this paper builds a hierarchy root cause diagnosis framework, named Hi-RCA. We propose a global perspective to characterize different abnormal symptoms, which focuses on changes in metrics’ causation and correlation. We decompose the diagnosis task into two phases: anomalous microservice location and anomalous reason diagnosis. In the first phase, we use Kalman filtering to quantify microservice abnormality based on the estimation error. In the second phase, we use causation analysis to identify anomalous metrics and generate anomaly knowledge graphs; by correlation analysis, we construct an anomaly propagation graph and explain the anomaly symptoms via graph comparison. Our experimental evaluation on an open dataset shows that Hi-RCA can effectively locate root causes with 90% mean average precision, outperforming state-of-the-art methods.
- 8 November 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (22) , 12126
Open AccessHi-RCA: A Hierarchy Anomaly Diagnosis Framework Based on Causality and Correlation Analysis
Microservice architecture has been widely adopted by large-scale applications. Due to the huge amount of data and complex microservice dependency, it also poses new challenges in ensuring reliable performance and maintenance. Existing approaches still suffer from limitations of anomaly data, over-simplification of metric relationships, and lack of diagnosing interpretability. To solve these issues, this paper builds a hierarchy root cause diagnosis framework, named Hi-RCA. We propose a global perspective to characterize different abnormal symptoms, which focuses on changes in metrics’ causation and correlation. We decompose the diagnosis task into two phases: anomalous microservice location and anomalous reason diagnosis. In the first phase, we use Kalman filtering to quantify microservice abnormality based on the estimation error. In the second phase, we use causation analysis to identify anomalous metrics and generate anomaly knowledge graphs; by correlation analysis, we construct an anomaly propagation graph and explain the anomaly symptoms via graph comparison. Our experimental evaluation on an open dataset shows that Hi-RCA can effectively locate root causes with 90% mean average precision, outperforming state-of-the-art methods.
- 22 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 20 (4) , 4751-4764
Dynamic Upgrade to SDN From a Global Perspective: Model and Its Heuristic Solutions
Software Defined Network (SDN) has been considered as one of the most promising next-generation network solutions due to its network programmability. However, the upgrade from legacy IP network to pure SDN network is in general a gradual process. From a global perspective, a dynamic upgrade strategy should not only aim to pursue the local goal at each step, but also strive to optimize the final global solution when the upgrading process terminates. This raises three essential questions: which switches to upgrade, when to upgrade, and how to deploy controllers. Due to the interaction between the local goals at intermediate steps and the global goal at the final step, answering these questions altogether from a global perspective is challenging. In this paper, we study the dynamic SDN upgrade problem from a global perspective and answer these three questions altogether. We formulate the problem as a dynamic optimization problem that optimizes the global and local goals at the same time. We then propose two new formulations to combine the global and local goals, and two heuristic algorithms to solve them, respectively. We evaluate the proposed model and algorithms on realistic network topologies. The results show their feasibility and superiority.
- 22 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 20 (4) , 4751-4764
Dynamic Upgrade to SDN From a Global Perspective: Model and Its Heuristic Solutions
Software Defined Network (SDN) has been considered as one of the most promising next-generation network solutions due to its network programmability. However, the upgrade from legacy IP network to pure SDN network is in general a gradual process. From a global perspective, a dynamic upgrade strategy should not only aim to pursue the local goal at each step, but also strive to optimize the final global solution when the upgrading process terminates. This raises three essential questions: which switches to upgrade, when to upgrade, and how to deploy controllers. Due to the interaction between the local goals at intermediate steps and the global goal at the final step, answering these questions altogether from a global perspective is challenging. In this paper, we study the dynamic SDN upgrade problem from a global perspective and answer these three questions altogether. We formulate the problem as a dynamic optimization problem that optimizes the global and local goals at the same time. We then propose two new formulations to combine the global and local goals, and two heuristic algorithms to solve them, respectively. We evaluate the proposed model and algorithms on realistic network topologies. The results show their feasibility and superiority.
- Open Access
- 1 May 2023
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E106.D (5) , 904-912
MicroState: An Anomaly Localization Method in Heterogeneous Microservice Systems
Microservice architecture has been widely adopted for large-scale applications because of its benefits of scalability, flexibility, and reliability. However, microservice architecture also proposes new challenges in diagnosing root causes of performance degradation. Existing methods rely on labeled data and suffer a high computation burden. This paper proposes MicroState, an unsupervised and lightweight method to pinpoint the root cause with detailed descriptions. We decompose root cause diagnosis into element location and detailed reason identification. To mitigate the impact of element heterogeneity and dynamic invocations, MicroState generates elements' invoked states, quantifies elements' abnormality by warping-based state comparison, and infers the anomalous group. MicroState locates the root cause element with the consideration of anomaly frequency and persistency. To locate the anomalous metric from diverse metrics, MicroState extracts metrics' trend features and evaluates metrics' abnormality based on their trend feature variation, which reduces the reliance on anomaly detectors. Our experimental evaluation based on public data of the Artificial intelligence for IT Operations Challenge (AIOps Challenge 2020) shows that MicroState locates root cause elements with 87% precision and diagnoses anomaly reasons accurately.
- 1 May 2023
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E106.D (5) , 904-912
Open AccessMicroState: An Anomaly Localization Method in Heterogeneous Microservice Systems
Microservice architecture has been widely adopted for large-scale applications because of its benefits of scalability, flexibility, and reliability. However, microservice architecture also proposes new challenges in diagnosing root causes of performance degradation. Existing methods rely on labeled data and suffer a high computation burden. This paper proposes MicroState, an unsupervised and lightweight method to pinpoint the root cause with detailed descriptions. We decompose root cause diagnosis into element location and detailed reason identification. To mitigate the impact of element heterogeneity and dynamic invocations, MicroState generates elements' invoked states, quantifies elements' abnormality by warping-based state comparison, and infers the anomalous group. MicroState locates the root cause element with the consideration of anomaly frequency and persistency. To locate the anomalous metric from diverse metrics, MicroState extracts metrics' trend features and evaluates metrics' abnormality based on their trend feature variation, which reduces the reliance on anomaly detectors. Our experimental evaluation based on public data of the Artificial intelligence for IT Operations Challenge (AIOps Challenge 2020) shows that MicroState locates root cause elements with 87% precision and diagnoses anomaly reasons accurately.
- Open Access
- 17 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 437-441
Microservice Anomaly Diagnosis with Graph Convolution Network Based on Implicit Microservice Dependency
- 17 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 437-441
Open AccessMicroservice Anomaly Diagnosis with Graph Convolution Network Based on Implicit Microservice Dependency
- Open Access
- 1 January 2023
- Published by World Scientific Pub Co Pte Ltd in Fractals
- Vol. 31 (06)
A LOAD BALANCE PERSONALIZED PATH FINDING WITH MULTIPLE-AGENT DEEP REINFORCEMENT LEARNING
Personalized path-finding allows a user to search for a travel path that can visit its several regions of interest (ROIs). Existing independent searching methods may bring many users to ROIs simultaneously, such as popular attractions in scenic, and thus induce traffic jams. Therefore, it is necessary to find a personalized travel path considering the load balance of traffic flow. However, it is challenging to ensure load balancing on the road and ROIs while allowing each user to visit their ROIs. In this paper, we propose a personalized path-finding method with a multi-agent path-finding (MAPF) framework. Based on the MAPF, it allows users to find the path independently, and we designed a reward to guide the agent simultaneously to navigate to the destination and ROIs for personalized travel. We also improve the architecture of MAPF to guide the agents in learning the load balance through a centralized value network. We evaluated the algorithm with up to 1024 agents on randomly generated road network graphs and compared it against state-of-the-art MAPF planners. We also trained the agent using imitation learning and validated our framework on real-world datasets. Experimental results show that our algorithm is efficient and better than the existing algorithms.
- 1 January 2023
- Published by World Scientific Pub Co Pte Ltd in Fractals
- Vol. 31 (06)
Open AccessA LOAD BALANCE PERSONALIZED PATH FINDING WITH MULTIPLE-AGENT DEEP REINFORCEMENT LEARNING
Personalized path-finding allows a user to search for a travel path that can visit its several regions of interest (ROIs). Existing independent searching methods may bring many users to ROIs simultaneously, such as popular attractions in scenic, and thus induce traffic jams. Therefore, it is necessary to find a personalized travel path considering the load balance of traffic flow. However, it is challenging to ensure load balancing on the road and ROIs while allowing each user to visit their ROIs. In this paper, we propose a personalized path-finding method with a multi-agent path-finding (MAPF) framework. Based on the MAPF, it allows users to find the path independently, and we designed a reward to guide the agent simultaneously to navigate to the destination and ROIs for personalized travel. We also improve the architecture of MAPF to guide the agents in learning the load balance through a centralized value network. We evaluated the algorithm with up to 1024 agents on randomly generated road network graphs and compared it against state-of-the-art MAPF planners. We also trained the agent using imitation learning and validated our framework on real-world datasets. Experimental results show that our algorithm is efficient and better than the existing algorithms.
- 6 January 2022
- Published by Elsevier in Computer Communications
- Vol. 185, 159-167
CSTRM: Contrastive Self-Supervised Trajectory Representation Model for trajectory similarity computation
- 6 January 2022
- Published by Elsevier in Computer Communications
- Vol. 185, 159-167
CSTRM: Contrastive Self-Supervised Trajectory Representation Model for trajectory similarity computation
- 1 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E103.B (12) , 1403-1410
ECG Classification with Multi-Scale Deep Features Based on Adaptive Beat-Segmentation
Recently, the ECG-based diagnosis system based on wearable devices has attracted more and more attention of researchers. Existing studies have achieved high classification accuracy by using deep neural networks (DNNs), but there are still some problems, such as: imprecise heart beat segmentation, inadequate use of medical knowledge, the same treatment of features with different importance. To address these problems, this paper: 1) proposes an adaptive segmenting-reshaping method to acquire abundant useful samples; 2) builds a set of hand-crafted features and deep features on the inner-beat, beat and inter-beat scale by integrating enough medical knowledge. 3) introduced a modified channel attention module (CAM) to augment the significant channels in deep features. Following the Association for Advancement of Medical Instrumentation (AAMI) recommendation, we classified the dataset into four classes and validated our algorithm on the MIT-BIH database. Experiments showthat the accuracy of our model reaches 96.94%, a 3.71% increase over that of a state-of-the-art alternative.
- 1 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E103.B (12) , 1403-1410
ECG Classification with Multi-Scale Deep Features Based on Adaptive Beat-Segmentation
Recently, the ECG-based diagnosis system based on wearable devices has attracted more and more attention of researchers. Existing studies have achieved high classification accuracy by using deep neural networks (DNNs), but there are still some problems, such as: imprecise heart beat segmentation, inadequate use of medical knowledge, the same treatment of features with different importance. To address these problems, this paper: 1) proposes an adaptive segmenting-reshaping method to acquire abundant useful samples; 2) builds a set of hand-crafted features and deep features on the inner-beat, beat and inter-beat scale by integrating enough medical knowledge. 3) introduced a modified channel attention module (CAM) to augment the significant channels in deep features. Following the Association for Advancement of Medical Instrumentation (AAMI) recommendation, we classified the dataset into four classes and validated our algorithm on the MIT-BIH database. Experiments showthat the accuracy of our model reaches 96.94%, a 3.71% increase over that of a state-of-the-art alternative.
- Open Access
- 28 May 2020
- Published by Association for Computing Machinery (ACM)
- p. 121-126
Learning Trajectory Routing with Graph Neural Networks
With the widespread application of vehicle GPS equipment, more and more trajectory data are becoming available. Traditional research on trajectory-based route planning uses trajectory data to build a weighted graph, and then obtains routes using classic graph theory-based search algorithms, which has difficulty in estimating multiple preferences. The Recurrent Graph Network (RGN) [1] is a graph neural network, which solves the shortest path problem as a classification problem, i.e., given arbitrary (source, destination) pair, classifying whether the nodes and edges in the graph should be labeled as "on the shortest path connecting the source and destination". Since the RGN model has non-linear feature representation ability and multiple feature fusion ability, this paper considers modifying it for the trajectory-based route planning. However, the actual trajectory data is highly sparse and non-uniform distributed, so that learning trajectory routing in large road networks is a few-shot learning task. To address the aforementioned challenges, this paper proposes the Long Short-Term Memory Graph Network (LSTM-GN) model. The LSTM-GN utilizes a deep LSTM-style message passing process to update various features including comprehensive node-level features, edge-level features and graph-level features, achieving trajectory routing patterns representation based on fewer samples. Additionally, the LSTM-GN needs to get over the difficulty of severe class imbalance and high computational complexity. This paper addresses the above challenges from two perspectives. Firstly, this paper proposes the subgraph filtering algorithms to narrow learning space. Secondly, this paper designs a dynamic weighted loss function to strengthen the positive class. This paper conducts experiments on the real-world trajectory dataset, and the main evaluation metric F1-score of LSTM-GN exceeds the RGN model by 19.18%.
- 28 May 2020
- Published by Association for Computing Machinery (ACM)
- p. 121-126
Open AccessLearning Trajectory Routing with Graph Neural Networks
With the widespread application of vehicle GPS equipment, more and more trajectory data are becoming available. Traditional research on trajectory-based route planning uses trajectory data to build a weighted graph, and then obtains routes using classic graph theory-based search algorithms, which has difficulty in estimating multiple preferences. The Recurrent Graph Network (RGN) [1] is a graph neural network, which solves the shortest path problem as a classification problem, i.e., given arbitrary (source, destination) pair, classifying whether the nodes and edges in the graph should be labeled as "on the shortest path connecting the source and destination". Since the RGN model has non-linear feature representation ability and multiple feature fusion ability, this paper considers modifying it for the trajectory-based route planning. However, the actual trajectory data is highly sparse and non-uniform distributed, so that learning trajectory routing in large road networks is a few-shot learning task. To address the aforementioned challenges, this paper proposes the Long Short-Term Memory Graph Network (LSTM-GN) model. The LSTM-GN utilizes a deep LSTM-style message passing process to update various features including comprehensive node-level features, edge-level features and graph-level features, achieving trajectory routing patterns representation based on fewer samples. Additionally, the LSTM-GN needs to get over the difficulty of severe class imbalance and high computational complexity. This paper addresses the above challenges from two perspectives. Firstly, this paper proposes the subgraph filtering algorithms to narrow learning space. Secondly, this paper designs a dynamic weighted loss function to strengthen the positive class. This paper conducts experiments on the real-world trajectory dataset, and the main evaluation metric F1-score of LSTM-GN exceeds the RGN model by 19.18%.
- 26 January 2020
- Published by Springer Nature
- p. 345-356
Any Privacy Risk if Nobody’s Personal Information Being Collected?
- 26 January 2020
- Published by Springer Nature
- p. 345-356
Any Privacy Risk if Nobody’s Personal Information Being Collected?