Yadong Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yadong Zhou has a total of 88 co-authors. Here are the top co-authors by number of shared publications:
- Ting Liu
Xi’an Jiaotong University
20 shared publications - Xiaohong Guan
Xi'an Jiaotong University, Xi'an, China
13 shared publications - Bowen Hu
Ministry of Education Key Laboratory for Intelligent Networks and Network Security, Faculty of Electronic and Information Engineering, Xian Jiaotong University, Xian, China
11 shared publications - Yang Liu
MOE KLINNS Laboratory, Xian Jiaotong University, Xian, Shaanxi, China
11 shared publications - Sizhe He
MOE KLINNS Laboratory, Xian Jiaotong University, Xian, Shaanxi, China
9 shared publications - Yuxun Zhou
Department of Electrical Engineering and Computer Sciences, University of California at Berkeley, Berkeley, CA, USA
7 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 17 (6) , 5784-5800
TAPINE: Topology-Adaptive Physics-Informed Neural Estimator for Fast DSSE
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 17 (6) , 5784-5800
TAPINE: Topology-Adaptive Physics-Informed Neural Estimator for Fast DSSE
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (6) , 4083-4095
A Bad Data Identification Method Based on Optimal Weight-Tuning for Power System State Estimation
The weighted least squares (WLS) method has been widely used in power systems for state estimation (SE), but in the presence of gross errors, the results of WLS SE can be significantly biased. While various bad data identification (BDI) methods exist, identifying multiple bad data for SE is still challenging, especially when bad data located at leverage points can disproportionately corrupt SE accuracy. This paper proposes an Optimal-Weighted Least Squares State Estimation (OWLS-SE) method with an optimal weight-tuning strategy to address these challenges. The impact of bad data at leverage points on estimation errors is first mathematically demonstrated through a theoretical upper bound of the SE relative error. Then, the optimal dynamic weights are developed to minimize this error bound by quantifying leverage point impacts and integrating them into a multi-objective optimization framework. The proposed OWLS-SE achieves simultaneous SE and BDI within a single optimization model, eliminating conventional two-stage processing. Numerical experiments on the 6- bus system, IEEE 30-, 118- bus systems, and the 2869- bus PEGASE system demonstrate that OWLS-SE achieves superior BDI and SE accuracy with robust performance even when multiple gross errors occur at leverage points, while maintaining computational efficiency comparable to the simplest WLS method.
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (6) , 4083-4095
A Bad Data Identification Method Based on Optimal Weight-Tuning for Power System State Estimation
The weighted least squares (WLS) method has been widely used in power systems for state estimation (SE), but in the presence of gross errors, the results of WLS SE can be significantly biased. While various bad data identification (BDI) methods exist, identifying multiple bad data for SE is still challenging, especially when bad data located at leverage points can disproportionately corrupt SE accuracy. This paper proposes an Optimal-Weighted Least Squares State Estimation (OWLS-SE) method with an optimal weight-tuning strategy to address these challenges. The impact of bad data at leverage points on estimation errors is first mathematically demonstrated through a theoretical upper bound of the SE relative error. Then, the optimal dynamic weights are developed to minimize this error bound by quantifying leverage point impacts and integrating them into a multi-objective optimization framework. The proposed OWLS-SE achieves simultaneous SE and BDI within a single optimization model, eliminating conventional two-stage processing. Numerical experiments on the 6- bus system, IEEE 30-, 118- bus systems, and the 2869- bus PEGASE system demonstrate that OWLS-SE achieves superior BDI and SE accuracy with robust performance even when multiple gross errors occur at leverage points, while maintaining computational efficiency comparable to the simplest WLS method.
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 17 (5) , 4568-4584
IGNN: An Inference Graph Neural Network for Data Sensitivity Assessment Considering Data Inference Leakage in Cyber-Physical Power Grid
Modern Cyber-Physical Power Grids (CPPG) rely heavily on fine-grained data exchange, yet they face the concealed threat of Data Inference Leakage (DIL), where attackers infer sensitive parameters from seemingly non-sensitive data. Existing risk assessment methods typically focus on direct cyber-attacks or employ static binary classifications, failing to capture the dynamic risk propagation caused by complex physical and statistical data couplings. To address this, this paper proposes a unified data sensitivity assessment framework based on a novel Inference Graph Neural Network (IGNN). We first construct an inference relation graph that integrates both model-driven and data-driven correlations. An analytic hierarchy process (AHP) model is constructed to calibrate the intrinsic sensitivity baseline. Subsequently, a novel inference-weighted Graph Attention Network (GAT) is developed to quantify the final sensitivity by aggregating the risk propagating through the inference pathways. Experiments on IEEE 30-, 57-bus, ACTIV 200-bus, and case 1354-pegase systems demonstrate that the proposed method effectively quantifies data sensitivity and identifies high-risk data susceptible to DIL, exhibiting strong robustness across different system scales. Quantitative results indicate that the high-sensitivity data identified by our method yield a highly threatening inference accuracy of up to 0.9145, significantly outperforming GCN-based and rule-based benchmarks.
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 17 (5) , 4568-4584
IGNN: An Inference Graph Neural Network for Data Sensitivity Assessment Considering Data Inference Leakage in Cyber-Physical Power Grid
Modern Cyber-Physical Power Grids (CPPG) rely heavily on fine-grained data exchange, yet they face the concealed threat of Data Inference Leakage (DIL), where attackers infer sensitive parameters from seemingly non-sensitive data. Existing risk assessment methods typically focus on direct cyber-attacks or employ static binary classifications, failing to capture the dynamic risk propagation caused by complex physical and statistical data couplings. To address this, this paper proposes a unified data sensitivity assessment framework based on a novel Inference Graph Neural Network (IGNN). We first construct an inference relation graph that integrates both model-driven and data-driven correlations. An analytic hierarchy process (AHP) model is constructed to calibrate the intrinsic sensitivity baseline. Subsequently, a novel inference-weighted Graph Attention Network (GAT) is developed to quantify the final sensitivity by aggregating the risk propagating through the inference pathways. Experiments on IEEE 30-, 57-bus, ACTIV 200-bus, and case 1354-pegase systems demonstrate that the proposed method effectively quantifies data sensitivity and identifies high-risk data susceptible to DIL, exhibiting strong robustness across different system scales. Quantitative results indicate that the high-sensitivity data identified by our method yield a highly threatening inference accuracy of up to 0.9145, significantly outperforming GCN-based and rule-based benchmarks.
- 28 June 2026
- Published by Elsevier in Information Fusion
- Vol. 136
Fusing semantic and structural representations for attributed community search
- 28 June 2026
- Published by Elsevier in Information Fusion
- Vol. 136
Fusing semantic and structural representations for attributed community search
- 28 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (2) , 722-735
A Dynamic-Causal Lens of Stock Interactions: Graph Modeling From Symbolic Movement Patterns
In modern quantitative finance and portfolio-based investment, modeling latent interactions among stocks is paramount for prediction and decision-making on profit, risk management, hedging, etc. While previous studies have constructed complex stock graphs for applying sophisticated variants of graph neural networks (GNNs), existing graph modeling approaches still face two limitations: 1) Correlation-based statistical relationships fail to unveil nuanced stock interactions effectively and determine directional influence. 2) Rigid and static graphs overlook the evolving graph structure of stocks in volatile financial systems. In this paper, we propose a dynamic-causal graph neural network (DC-GNN) to discover causal interactions from the non-stationary price time series and dynamically model graph structures for stock movement prediction. More specifically, we identify the pattern prototypes of all directed stock pairs from long-term price movement knowledge to quantify their causal interactions. These prototypes capture the pattern-to-pattern correspondence across time series based on symbolic dynamics. By inferring real-time stock networks from the prototypes, we encapsulate neighbor-induced causal impacts within heterogeneous edges to model bullish, bearish, and neutral effects among stocks. Extensive experiments conducted on real-world trading data demonstrate the superiority of the proposed framework over various state-of-the-art baselines and its effectiveness, robustness, and interpretability in Fintech.
- 28 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (2) , 722-735
A Dynamic-Causal Lens of Stock Interactions: Graph Modeling From Symbolic Movement Patterns
In modern quantitative finance and portfolio-based investment, modeling latent interactions among stocks is paramount for prediction and decision-making on profit, risk management, hedging, etc. While previous studies have constructed complex stock graphs for applying sophisticated variants of graph neural networks (GNNs), existing graph modeling approaches still face two limitations: 1) Correlation-based statistical relationships fail to unveil nuanced stock interactions effectively and determine directional influence. 2) Rigid and static graphs overlook the evolving graph structure of stocks in volatile financial systems. In this paper, we propose a dynamic-causal graph neural network (DC-GNN) to discover causal interactions from the non-stationary price time series and dynamically model graph structures for stock movement prediction. More specifically, we identify the pattern prototypes of all directed stock pairs from long-term price movement knowledge to quantify their causal interactions. These prototypes capture the pattern-to-pattern correspondence across time series based on symbolic dynamics. By inferring real-time stock networks from the prototypes, we encapsulate neighbor-induced causal impacts within heterogeneous edges to model bullish, bearish, and neutral effects among stocks. Extensive experiments conducted on real-world trading data demonstrate the superiority of the proposed framework over various state-of-the-art baselines and its effectiveness, robustness, and interpretability in Fintech.
- 16 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (23) , 50569-50583
A Cyber–Physical Security Assessment Model for Distribution Grid With High Penetration of Electric Vehicle Charging Infrastructure
A distribution grid with electric vehicle (EV) charging infrastructure can be modeled as a coupled network consisting of a cyber network, a distribution grid, and a traffic network. The interconnection of the coupled network allows attackers to launch cyberattacks and control numerous EVs to cause severe load fluctuations, thereby affecting the normal operation of the distribution grid and the traffic flow. To evaluate the cyber–physical security of the coupled network, we present a security assessment model formulated as a coupled discrete event system specification (DEVS). In this model, the evolution of the coupled network is represented as state transitions triggered by events in a discrete-time process, while the interaction is achieved through event transmission, reception, and processing. To determine the redistribution of states influenced by the selection of EV charging stations and moving paths, we propose a spatial–temporal evolution mechanism. Based on the assessment model, we propose an event-triggered simulation method. The efficiency of the proposed simulation method is evaluated by comparing it with the multilayer synchronous simulation method. Compared with the existing security assessment models, the simulation results of our model are more accurate.
- 16 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (23) , 50569-50583
A Cyber–Physical Security Assessment Model for Distribution Grid With High Penetration of Electric Vehicle Charging Infrastructure
A distribution grid with electric vehicle (EV) charging infrastructure can be modeled as a coupled network consisting of a cyber network, a distribution grid, and a traffic network. The interconnection of the coupled network allows attackers to launch cyberattacks and control numerous EVs to cause severe load fluctuations, thereby affecting the normal operation of the distribution grid and the traffic flow. To evaluate the cyber–physical security of the coupled network, we present a security assessment model formulated as a coupled discrete event system specification (DEVS). In this model, the evolution of the coupled network is represented as state transitions triggered by events in a discrete-time process, while the interaction is achieved through event transmission, reception, and processing. To determine the redistribution of states influenced by the selection of EV charging stations and moving paths, we propose a spatial–temporal evolution mechanism. Based on the assessment model, we propose an event-triggered simulation method. The efficiency of the proposed simulation method is evaluated by comparing it with the multilayer synchronous simulation method. Compared with the existing security assessment models, the simulation results of our model are more accurate.
- 3 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 73 (2) , 1460-1473
A Markov Tree Model for Cascading Failure Risk Assessment in Power Grid With Uncertain Renewable Energy Generation
The increasing penetration of renewable energy generation (REG) introduces significant uncertainty into power grids, posing heightened risks for cascading failures. In this paper, a Markov tree model is proposed to assess the risk of cascading failure in power grid with uncertain REG. The model captures the diverse failure paths caused by REG uncertainty, representing the cascading failure process as a sequence of state transitions with probabilities reflecting the likelihood of state transitions. To identify critical tripping branches during cascading failure propagation, a hybrid probability-interval method is introduced. Probabilistic power flow analysis identifies branches with overload risk, while interval positional relationships rank their severity. To improve the efficiency of risk assessment, a risk-based depth-first search (R-DFS) method is proposed. This method uses estimated risk indices to prioritize high-risk failure paths while pruning low-risk paths, significantly reducing simulation time while maintaining assessment accuracy. Compared with existing models, the proposed model balances simulation efficiency and accuracy, effectively identifying high-risk failure paths under REG uncertainty. Simulation results demonstrate the impact of threshold selection on the retention of high-risk paths and simulation performance, providing insights into managing cascading failure risks in power grid with high REG penetration.
- 3 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 73 (2) , 1460-1473
A Markov Tree Model for Cascading Failure Risk Assessment in Power Grid With Uncertain Renewable Energy Generation
The increasing penetration of renewable energy generation (REG) introduces significant uncertainty into power grids, posing heightened risks for cascading failures. In this paper, a Markov tree model is proposed to assess the risk of cascading failure in power grid with uncertain REG. The model captures the diverse failure paths caused by REG uncertainty, representing the cascading failure process as a sequence of state transitions with probabilities reflecting the likelihood of state transitions. To identify critical tripping branches during cascading failure propagation, a hybrid probability-interval method is introduced. Probabilistic power flow analysis identifies branches with overload risk, while interval positional relationships rank their severity. To improve the efficiency of risk assessment, a risk-based depth-first search (R-DFS) method is proposed. This method uses estimated risk indices to prioritize high-risk failure paths while pruning low-risk paths, significantly reducing simulation time while maintaining assessment accuracy. Compared with existing models, the proposed model balances simulation efficiency and accuracy, effectively identifying high-risk failure paths under REG uncertainty. Simulation results demonstrate the impact of threshold selection on the retention of high-risk paths and simulation performance, providing insights into managing cascading failure risks in power grid with high REG penetration.
- 18 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (11) , 9057-9068
Privacy-Preserving Distributed Economic Dispatch Based on State Decomposition in Smart Grids
Consensus-based distributed economic dispatch (ED) algorithms are promising solutions to the smart grid ED problem. However, distributed algorithms necessitate data sharing among system nodes, potentially compromising node privacy. This study proposes a privacy-preserving method based on state decomposition. By introducing random noises, the shared data of a node is decomposed into several parts, and each neighbor of the node receives only a random subset of the original data, thereby increasing the difficulty of inferring the node’s privacy from its shared data. It is theoretically proved that the method can preserve privacy without compromising the algorithm optimality. Compared to existing works, the method simultaneously achieves privacy preservation, optimality, low cost, and does not require extra communication. Moreover, the method is developed in a challenging scenario, where adversaries know the connection weights between each pair of nodes, ensuring no privacy is disclosed even if weight information is leaked. The effectiveness is validated on the IEEE 57-bus and IEEE 300-bus systems through comparisons with existing privacy-preserving methods.
- 18 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (11) , 9057-9068
Privacy-Preserving Distributed Economic Dispatch Based on State Decomposition in Smart Grids
Consensus-based distributed economic dispatch (ED) algorithms are promising solutions to the smart grid ED problem. However, distributed algorithms necessitate data sharing among system nodes, potentially compromising node privacy. This study proposes a privacy-preserving method based on state decomposition. By introducing random noises, the shared data of a node is decomposed into several parts, and each neighbor of the node receives only a random subset of the original data, thereby increasing the difficulty of inferring the node’s privacy from its shared data. It is theoretically proved that the method can preserve privacy without compromising the algorithm optimality. Compared to existing works, the method simultaneously achieves privacy preservation, optimality, low cost, and does not require extra communication. Moreover, the method is developed in a challenging scenario, where adversaries know the connection weights between each pair of nodes, ensuring no privacy is disclosed even if weight information is leaked. The effectiveness is validated on the IEEE 57-bus and IEEE 300-bus systems through comparisons with existing privacy-preserving methods.
- 16 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 6443-6458
DeepDRAC: Disposition Recommendation for Alert Clusters Based on Security Event Patterns
In the security operation center, false positive alerts generated by security devices overwhelm security operators, leading to alert fatigue and inefficiency in identifying real threats. This paper introduces DEEPDRAC, a disposition recommendation method for alert clusters that is based on security event patterns. Our main idea is to reconstruct isolated alerts into security events and capture their essential threat characteristics as patterns. By recommending pattern information, we enable batch interpretable disposal of alerts. First, DEEPDRAC aggregates correlated alerts to a graph, representing a security event. Then, it extracts the features of the security event from two aspects: basic features via statistical methods and detailed features via a carefully designed Graph Neural Network (GNN) that focuses on edge features. Since many false alerts triggered by the same cause often recur in a fixed pattern, DEEPDRAC translates basic features into interpretable descriptors to define the basic pattern, whereas GNN embeddings complement detailed semantic information, serving as the detailed pattern, together forming the pattern of the security event. The pattern describes the critical information of the security event, so security events with the same pattern are clustered for batch processing. Finally, with few manually labeled security events, DEEPDRAC can conduct automatic disposition recommendations for newly arrived alerts, significantly reducing the workload of alert analysis. We evaluate our approach on two benchmark datasets (i.e., DARPA 1999 and CIC-IDS2017) and a real-world dataset from a large power company. The extensive experimental results demonstrate that our approach can alleviate alert fatigue more efficiently and accurately than the two state-of-the-art defense approaches can.
- 16 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 6443-6458
DeepDRAC: Disposition Recommendation for Alert Clusters Based on Security Event Patterns
In the security operation center, false positive alerts generated by security devices overwhelm security operators, leading to alert fatigue and inefficiency in identifying real threats. This paper introduces DEEPDRAC, a disposition recommendation method for alert clusters that is based on security event patterns. Our main idea is to reconstruct isolated alerts into security events and capture their essential threat characteristics as patterns. By recommending pattern information, we enable batch interpretable disposal of alerts. First, DEEPDRAC aggregates correlated alerts to a graph, representing a security event. Then, it extracts the features of the security event from two aspects: basic features via statistical methods and detailed features via a carefully designed Graph Neural Network (GNN) that focuses on edge features. Since many false alerts triggered by the same cause often recur in a fixed pattern, DEEPDRAC translates basic features into interpretable descriptors to define the basic pattern, whereas GNN embeddings complement detailed semantic information, serving as the detailed pattern, together forming the pattern of the security event. The pattern describes the critical information of the security event, so security events with the same pattern are clustered for batch processing. Finally, with few manually labeled security events, DEEPDRAC can conduct automatic disposition recommendations for newly arrived alerts, significantly reducing the workload of alert analysis. We evaluate our approach on two benchmark datasets (i.e., DARPA 1999 and CIC-IDS2017) and a real-world dataset from a large power company. The extensive experimental results demonstrate that our approach can alleviate alert fatigue more efficiently and accurately than the two state-of-the-art defense approaches can.
- 28 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (6) , 10099-10113
Responding to News Sensitively in Stock Attention Networks via Prompt-Adaptive Trimodal Model
Modern quantitative finance and portfolio-based investment hinge on multimedia news and historical price trends for stock movement prediction. However, prior studies overlook the long tail effect in the feature distribution of stocks, inevitably leading to biased attention and thus degrading the efficiency of utilizing news. To this end, we propose a prompt-adaptive trimodal model (PA-TMM) to overcome the biased stock attention networks and tail feature scarcity problem. In this model, sentiments automatically extracted from trimodal information serve as prompts reflecting the market’s collective mood for other entities, and the interactions among stocks are dynamically inferred for integrating both news- and price-induced movements. By leveraging the movement prompt adaptation (MPA) strategy, our model proactively adapts to the feature-imbalanced phenomenon and converges toward being responsive to the news sensitively. Extensive experiments conducted on real-world datasets consistently demonstrate not only the superiority of the proposed framework over various state-of-the-art baselines, but also its effectiveness, profitability, and robustness in Fintech. The code is accessible at https://github.com/lauht/PA-TMM.
- 28 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (6) , 10099-10113
Responding to News Sensitively in Stock Attention Networks via Prompt-Adaptive Trimodal Model
Modern quantitative finance and portfolio-based investment hinge on multimedia news and historical price trends for stock movement prediction. However, prior studies overlook the long tail effect in the feature distribution of stocks, inevitably leading to biased attention and thus degrading the efficiency of utilizing news. To this end, we propose a prompt-adaptive trimodal model (PA-TMM) to overcome the biased stock attention networks and tail feature scarcity problem. In this model, sentiments automatically extracted from trimodal information serve as prompts reflecting the market’s collective mood for other entities, and the interactions among stocks are dynamically inferred for integrating both news- and price-induced movements. By leveraging the movement prompt adaptation (MPA) strategy, our model proactively adapts to the feature-imbalanced phenomenon and converges toward being responsive to the news sensitively. Extensive experiments conducted on real-world datasets consistently demonstrate not only the superiority of the proposed framework over various state-of-the-art baselines, but also its effectiveness, profitability, and robustness in Fintech. The code is accessible at https://github.com/lauht/PA-TMM.