Ke Yu
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
Research Subjects
Ke Yu has a total of 58 co-authors. Here are the top co-authors by number of shared publications:
- Xiaofei Wu
School of Artificial Intelligence, Beijing University of Posts and Telecommunications, Beijing 100876, China
7 shared publications - Hao Zhou
Beijing University of Posts and Telecommunications, Beijing, China
5 shared publications Xiaofei Wu
School of Artificial Intelligence, Beijing University of Posts and Telecommunications, Beijing, China
5 shared publications- Yue Liu
School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing, 100876, China
3 shared publications - Anis Yazidi
Department of Computer Science, Oslo Metropolitan University, 0167 Oslo, Norway
2 shared publications Hao Zhou
School of Artificial Intelligence, Beijing University of Posts and Telecommunications, Beijing, China
2 shared publications
Latest Publications
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (13) , 28165-28180
Temporal Conditional Score Network for Multivariate Time Series Anomaly Detection
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (13) , 28165-28180
Temporal Conditional Score Network for Multivariate Time Series Anomaly Detection
- Open Access
A Neural Network-Enhanced Kalman Filter for Time Series Anomaly Detection in Cyber-Physical Systems
Cyber-physical systems (CPSs) represent sophisticated intelligent architectures that tightly couple computational elements, communication networks, and physical processes. Their deployments now span virtually every industrial and civilian domain—from power grids and manufacturing plants to autonomous transportation networks. Ensuring the secure operation of CPSs relies fundamentally on effective time series anomaly detection, which remains a challenging task due to the complex, often unknown system dynamics and non-negligible sensor noise present in real-world environments. To address these challenges, we introduce a Neural Network-Enhanced Kalman Filter (NNEKF), a novel anomaly detection framework that combines model-based filtering with data-driven learning. The NNEKF employs a two-stage trained neural network with a specialized architecture: the first stage learns the underlying dynamics of the CPS, while the second stage optimizes the computation of the Kalman gain during the update step. At inference time, the enhanced Kalman filter recursively estimates the likelihood of observed sensor measurements to identify anomalies, supported by a batched parallel inference scheme that delivers substantial speedups. Extensive experiments on benchmark datasets demonstrate that the NNEKF attains an average F1-score of 0.935, coupled with rapid inference and minimal model footprint—surpassing all competitive baselines and facilitating dependable real-time anomaly detection for CPS environments.
Open AccessA Neural Network-Enhanced Kalman Filter for Time Series Anomaly Detection in Cyber-Physical Systems
Cyber-physical systems (CPSs) represent sophisticated intelligent architectures that tightly couple computational elements, communication networks, and physical processes. Their deployments now span virtually every industrial and civilian domain—from power grids and manufacturing plants to autonomous transportation networks. Ensuring the secure operation of CPSs relies fundamentally on effective time series anomaly detection, which remains a challenging task due to the complex, often unknown system dynamics and non-negligible sensor noise present in real-world environments. To address these challenges, we introduce a Neural Network-Enhanced Kalman Filter (NNEKF), a novel anomaly detection framework that combines model-based filtering with data-driven learning. The NNEKF employs a two-stage trained neural network with a specialized architecture: the first stage learns the underlying dynamics of the CPS, while the second stage optimizes the computation of the Kalman gain during the update step. At inference time, the enhanced Kalman filter recursively estimates the likelihood of observed sensor measurements to identify anomalies, supported by a batched parallel inference scheme that delivers substantial speedups. Extensive experiments on benchmark datasets demonstrate that the NNEKF attains an average F1-score of 0.935, coupled with rapid inference and minimal model footprint—surpassing all competitive baselines and facilitating dependable real-time anomaly detection for CPS environments.
- 17 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 12491-12506
SRLR: Symbolic Regression-Based Logic Recovery to Counter Programmable Logic Controller Attacks
Programmable Logic Controllers (PLCs) are critical components in Industrial Control Systems (ICSs). Their potential exposure to external world makes them susceptible to cyber-attacks. Existing detection methods against controller logic attacks use either specification-based or learnt models. However, specification-based models require experts’ manual efforts or access to PLC’s source code, while machine learning-based models often fall short of providing explanation for their decisions. We design SRLR — a Symbolic Regression based Logic Recovery solution to identify the logic of a PLC based only on its inputs and outputs. The recovered logic is used to generate explainable rules for detecting controller logic attacks. SRLR enhances the latest deep symbolic regression methods using the following ICS-specific properties: (1) some important ICS control logic is best represented in frequency domain rather than time domain; (2) an ICS controller can operate in multiple modes, each using different logic, where mode switches usually do not happen frequently; (3) a robust controller usually filters out outlier inputs as ICS sensor data can be noisy; and (4) with the above factors captured, the degree of complexity of the formulas is reduced, making effective search possible. Thanks to these enhancements, SRLR consistently outperforms all existing methods in a variety of ICS settings that we evaluate. In terms of the recovery accuracy, SRLR’s gain can be as high as 39% in some challenging environment. We also evaluate SRLR on a distribution grid containing hundreds of voltage regulators, demonstrating its stability in handling large-scale, complex systems with varied configurations.
- 17 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 12491-12506
SRLR: Symbolic Regression-Based Logic Recovery to Counter Programmable Logic Controller Attacks
Programmable Logic Controllers (PLCs) are critical components in Industrial Control Systems (ICSs). Their potential exposure to external world makes them susceptible to cyber-attacks. Existing detection methods against controller logic attacks use either specification-based or learnt models. However, specification-based models require experts’ manual efforts or access to PLC’s source code, while machine learning-based models often fall short of providing explanation for their decisions. We design SRLR — a Symbolic Regression based Logic Recovery solution to identify the logic of a PLC based only on its inputs and outputs. The recovered logic is used to generate explainable rules for detecting controller logic attacks. SRLR enhances the latest deep symbolic regression methods using the following ICS-specific properties: (1) some important ICS control logic is best represented in frequency domain rather than time domain; (2) an ICS controller can operate in multiple modes, each using different logic, where mode switches usually do not happen frequently; (3) a robust controller usually filters out outlier inputs as ICS sensor data can be noisy; and (4) with the above factors captured, the degree of complexity of the formulas is reduced, making effective search possible. Thanks to these enhancements, SRLR consistently outperforms all existing methods in a variety of ICS settings that we evaluate. In terms of the recovery accuracy, SRLR’s gain can be as high as 39% in some challenging environment. We also evaluate SRLR on a distribution grid containing hundreds of voltage regulators, demonstrating its stability in handling large-scale, complex systems with varied configurations.
- 7 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 2604-2622
Constrained Probabilistic Routing With RouterRL: A General Packet-Level Network Simulation Framework
Routing optimization remains challenging in traffic engineering as increasing traffic in dynamic networks often leads to congestion and resource wastage. To address it, probabilistic routing strategies based on deep reinforcement learning (DRL) with finer-grained routing control and autonomous learning capabilities are considered promising solutions. However, current DRL-based probabilistic routing approaches are limited by the lack of constraints for routing safety and cross-comparisons with other routing strategies. This paper proposes a constrained multi-agent DRL-based probabilistic routing approach, which employs a novel actor-critic architecture called JointGAT based on graph attention networks and is trained using clipped proximal policy optimization. Besides, this paper proposes a novel probabilistic routing protocol for constraints to ensure routing safety. For validation and comparison, an open-source general packet-level network simulation framework called RouterRL is designed and implemented based on the knowledge-defined networking architecture, supporting cross-comparisons of different routing strategies. We compare the performance of the proposed approach with various benchmark approaches using different routing strategies. Extensive simulation results across various topologies and loads demonstrate that the proposed approach significantly outperforms benchmark approaches regarding network quality of service and robustness.
- 7 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 2604-2622
Constrained Probabilistic Routing With RouterRL: A General Packet-Level Network Simulation Framework
Routing optimization remains challenging in traffic engineering as increasing traffic in dynamic networks often leads to congestion and resource wastage. To address it, probabilistic routing strategies based on deep reinforcement learning (DRL) with finer-grained routing control and autonomous learning capabilities are considered promising solutions. However, current DRL-based probabilistic routing approaches are limited by the lack of constraints for routing safety and cross-comparisons with other routing strategies. This paper proposes a constrained multi-agent DRL-based probabilistic routing approach, which employs a novel actor-critic architecture called JointGAT based on graph attention networks and is trained using clipped proximal policy optimization. Besides, this paper proposes a novel probabilistic routing protocol for constraints to ensure routing safety. For validation and comparison, an open-source general packet-level network simulation framework called RouterRL is designed and implemented based on the knowledge-defined networking architecture, supporting cross-comparisons of different routing strategies. We compare the performance of the proposed approach with various benchmark approaches using different routing strategies. Extensive simulation results across various topologies and loads demonstrate that the proposed approach significantly outperforms benchmark approaches regarding network quality of service and robustness.
- 10 September 2025
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 26 (9) , 1551-1576
Deep anomaly detection of temporal heterogeneous data in AIOps: a survey
The advancement of the fifth generation (5G) mobile communication and Internet of Things (IoT) has facilitated the development of intelligent applications,
- 10 September 2025
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 26 (9) , 1551-1576
Deep anomaly detection of temporal heterogeneous data in AIOps: a survey
The advancement of the fifth generation (5G) mobile communication and Internet of Things (IoT) has facilitated the development of intelligent applications,
- Open Access
- 21 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 93-100
Computing Power and Energy Aware Optimized Link State Routing for Flying Ad Hoc Networks
- 21 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 93-100
Open AccessComputing Power and Energy Aware Optimized Link State Routing for Flying Ad Hoc Networks
- 5 October 2024
- Published by Springer Nature in Wireless Personal Communications
- Vol. 138 (3) , 1867-1892
Cellular Network Traffic Prediction with Hybrid Graph Convolutional Recurrent Network
- 5 October 2024
- Published by Springer Nature in Wireless Personal Communications
- Vol. 138 (3) , 1867-1892
Cellular Network Traffic Prediction with Hybrid Graph Convolutional Recurrent Network
- 1 May 2024
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 25 (5) , 701-712
Combining graph neural network with deep reinforcement learning for resource allocation in computing force networks
Fueled by the explosive growth of ultra-low-latency and real-time applications with specific computing and network performance requirements, the computing
- 1 May 2024
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 25 (5) , 701-712
Combining graph neural network with deep reinforcement learning for resource allocation in computing force networks
Fueled by the explosive growth of ultra-low-latency and real-time applications with specific computing and network performance requirements, the computing
- Open Access
- 5 January 2024
- Published by MDPI AG in Bioengineering
- Vol. 11 (1) , 53
Time-Series Anomaly Detection Based on Dynamic Temporal Graph Convolutional Network for Epilepsy Diagnosis
Electroencephalography (EEG) is typical time-series data. Designing an automatic detection model for EEG is of great significance for disease diagnosis. For example, EEG stands as one of the most potent diagnostic tools for epilepsy detection. A myriad of studies have employed EEG to detect and classify epilepsy, yet these investigations harbor certain limitations. Firstly, most existing research concentrates on the labels of sliced EEG signals, neglecting epilepsy labels associated with each time step in the original EEG signal—what we term fine-grained labels. Secondly, a majority of these studies utilize static graphs to depict EEG’s spatial characteristics, thereby disregarding the dynamic interplay among EEG channels. Consequently, the efficient nature of EEG structures may not be captured. In response to these challenges, we propose a novel seizure detection and classification framework—the dynamic temporal graph convolutional network (DTGCN). This method is specifically designed to model the interdependencies in temporal and spatial dimensions within EEG signals. The proposed DTGCN model includes a unique seizure attention layer conceived to capture the distribution and diffusion patterns of epilepsy. Additionally, the model incorporates a graph structure learning layer to represent the dynamically evolving graph structure inherent in the data. We rigorously evaluated the proposed DTGCN model using a substantial publicly available dataset, TUSZ, consisting of 5499 EEGs. The subsequent experimental results convincingly demonstrated that the DTGCN model outperformed the existing state-of-the-art methods in terms of efficiency and accuracy for both seizure detection and classification tasks.
- 5 January 2024
- Published by MDPI AG in Bioengineering
- Vol. 11 (1) , 53
Open AccessTime-Series Anomaly Detection Based on Dynamic Temporal Graph Convolutional Network for Epilepsy Diagnosis
Electroencephalography (EEG) is typical time-series data. Designing an automatic detection model for EEG is of great significance for disease diagnosis. For example, EEG stands as one of the most potent diagnostic tools for epilepsy detection. A myriad of studies have employed EEG to detect and classify epilepsy, yet these investigations harbor certain limitations. Firstly, most existing research concentrates on the labels of sliced EEG signals, neglecting epilepsy labels associated with each time step in the original EEG signal—what we term fine-grained labels. Secondly, a majority of these studies utilize static graphs to depict EEG’s spatial characteristics, thereby disregarding the dynamic interplay among EEG channels. Consequently, the efficient nature of EEG structures may not be captured. In response to these challenges, we propose a novel seizure detection and classification framework—the dynamic temporal graph convolutional network (DTGCN). This method is specifically designed to model the interdependencies in temporal and spatial dimensions within EEG signals. The proposed DTGCN model includes a unique seizure attention layer conceived to capture the distribution and diffusion patterns of epilepsy. Additionally, the model incorporates a graph structure learning layer to represent the dynamically evolving graph structure inherent in the data. We rigorously evaluated the proposed DTGCN model using a substantial publicly available dataset, TUSZ, consisting of 5499 EEGs. The subsequent experimental results convincingly demonstrated that the DTGCN model outperformed the existing state-of-the-art methods in terms of efficiency and accuracy for both seizure detection and classification tasks.
- Open Access
- 8 February 2023
- Published by MDPI AG in Algorithms
- Vol. 16 (2) , 93
Tsetlin Machine for Sentiment Analysis and Spam Review Detection in Chinese
In Natural Language Processing (NLP), deep-learning neural networks have superior performance but pose transparency and explainability barriers, due to their black box nature, and, thus, there is lack of trustworthiness. On the other hand, classical machine learning techniques are intuitive and easy to understand but often cannot perform satisfactorily. Fortunately, many research studies have recently indicated that the newly introduced model, Tsetlin Machine (TM), has reliable performance and, at the same time, enjoys human-level interpretability by nature, which is a promising approach to trade off effectiveness and interpretability. However, nearly all of the related works so far have concentrated on the English language, while research on other languages is relatively scarce. So, we propose a novel method, based on the TM model, in which the learning process is transparent and easily-understandable for Chinese NLP tasks. Our model can learn semantic information in the Chinese language by clauses. For evaluation, we conducted experiments in two domains, namely sentiment analysis and spam review detection. The experimental results showed thatm for both domains, our method could provide higher accuracy and a higher F1 score than complex, but non-transparent, deep-learning models, such as BERT and ERINE.
- 8 February 2023
- Published by MDPI AG in Algorithms
- Vol. 16 (2) , 93
Open AccessTsetlin Machine for Sentiment Analysis and Spam Review Detection in Chinese
In Natural Language Processing (NLP), deep-learning neural networks have superior performance but pose transparency and explainability barriers, due to their black box nature, and, thus, there is lack of trustworthiness. On the other hand, classical machine learning techniques are intuitive and easy to understand but often cannot perform satisfactorily. Fortunately, many research studies have recently indicated that the newly introduced model, Tsetlin Machine (TM), has reliable performance and, at the same time, enjoys human-level interpretability by nature, which is a promising approach to trade off effectiveness and interpretability. However, nearly all of the related works so far have concentrated on the English language, while research on other languages is relatively scarce. So, we propose a novel method, based on the TM model, in which the learning process is transparent and easily-understandable for Chinese NLP tasks. Our model can learn semantic information in the Chinese language by clauses. For evaluation, we conducted experiments in two domains, namely sentiment analysis and spam review detection. The experimental results showed thatm for both domains, our method could provide higher accuracy and a higher F1 score than complex, but non-transparent, deep-learning models, such as BERT and ERINE.