A Data Imputation Model in Phasor Measurement Units Based on Bagged Averaging of Multiple Linear Regression
Bibliographic record
Abstract
Synchrophasor data from the phasor measurement unit (PMU) indicate the health of the electrical system. However, the PMU performance relies entirely on a supported communication network. The existing communication approaches do not guarantee the error-free channel for the PMU network. Meanwhile, the mean or median approaches are commonly used to impute the missing value. These methods, however, fail to recover some valuable frequency events. In this paper, we first proved the multiple linear regression features in many synchronized frequency data streams in the short-time window. Then, we proposed the Bagged Averaging of Multiple Linear Regression model, which handles and fulfills the missing values in synchronized frequency data measurement fast and efficiently. This technique was based on the ensemble learning by bootstrapping and averaging many multiple linear regressions to predict the missing values. Various experiments on the synchronized frequency measurement data from the Texas synchrophasor network have demonstrated the effectiveness of our proposed approach in recovering the missing frequency events. Our proposed approach guarantees the performance of real-time wide area monitoring system applications, such as frequency analysis or stability monitoring and trending.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.006 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.003 | 0.002 |
| Bibliometrics | 0.001 | 0.003 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.004 | 0.002 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".