4.7 Article

Precise Recovery of Corrupted Synchrophasors Based on Autoregressive Bayesian Low-Rank Factorization and Adaptive K-Medoids Clustering

期刊

IEEE TRANSACTIONS ON POWER SYSTEMS
卷 38, 期 6, 页码 5834-5848

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TPWRS.2022.3221291

关键词

Synchrophasor; corruption recovery; DTW distance; Bayesian inference; low-rank factorization; rank reduction

向作者/读者索取更多资源

This paper proposes autoregressive Bayesian low-rank matrix/Hankel tensor factorization algorithms to address the problems of PMU data quality. The effectiveness of the algorithms is demonstrated through comprehensive case studies, showing higher recovery precision and suitability for processing offline data blocks and online real-time recovery.
Phasor measurement unit (PMU) data quality problems, such as data loss and modification caused by communication contingencies and cyber attacks, threaten the reliability and stability of modern power systems. In this paper, autoregressive Bayesian low-rank matrix/Hankel tensor factorization (BLMF/BLTF) algorithms are proposed to recover corrupted synchrophasor measurements by leveraging the latent electrical-temporal correlations between data points. To mitigate the impact of consecutive data anomalies on recovery, adaptive k-Medoids clustering based on dynamic time wrapping (DTW) distance and Canopy clustering is introduced to preprocess raw data. The effectiveness of the proposed algorithms in recovering missing or modified synchrophasor measurements is demonstrated through comprehensive case studies. Compared with previous works, the proposed algorithms rely on simpler prior hypotheses and can achieve higher recovery precision. Rank reduction and low-cost rolling prediction techniques make the proposed algorithms suitable not only for processing offline data blocks but also for online real-time recovery of PMU data streams.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据