{'fraction_non_alphanumeric': 0.026404874746106973, 'fraction_numerical': 0.0, 'mean_word_length': 5.657657657657658, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Data-driven Robust State Estimation Through Off-line Learning and On-line Matching

To overcome the shortcomings of model-driven state estimation methods, this paper proposes a data-driven robust state estimation (DDSE) method through off-line learning and on-line matching. At the off-line learning stage, a linear regression equation is presented by clustering historical data from supervisory control and data acquisition (SCADA), which provides a guarantee for solving the over-learning problem of the existing DDSE methods; then a novel robust state estimation method that can be transformed into quadratic programming (QP) models is proposed to obtain the mapping relationship between the measurements and the state variables (MRBMS). The proposed QP models can well solve the problem of collinearity in historical data. Furthermore, the off-line learning stage is greatly accelerated from three aspects including reducing historical categories, constructing tree retrieval structure for known topologies, and using sensitivity analysis when solving QP models. At the on-line matching stage, by quickly matching the current snapshot with the historical ones, the corresponding MRBMS can be obtained, and then the estimation values of the state variables can be obtained. Simulations demonstrate that the proposed DDSE method has obvious advantages in terms of suppressing over-learning problems, dealing with collinearity problems, robustness, and computation efficiency.