Combined analysis of distribution‐level PMU data with transmission‐level PMU for early detection of long‐term voltage instability
Bibliographic record
Abstract
In the present study, a new method is proposed for early voltage instability detection based on the statistical analysis of the data obtained from PMUs and micro‐PMUs. Although, the use of high sampling rate measurements helps operators to assess the dynamic behavior of the systems, but it may lead to processing a large volume of data, which is a main challenge in this regard. Here, K‐Medoid partitioning method is used for clustering and reducing the computational burden. Clustering is done based on the analysis of the voltage magnitude variance in unstable scenarios. Based on the critical slowing down phenomenon, the voltage magnitude variance in the critical transmission‐level busbars and in the power plant busbars are used as instability detection indices. The data measured by PMUs give information about severity of the events, and micro‐PMUs data provide information on operating status of the over‐excitation limiters as well as the resiliency of network to keep voltage. In different conditions of the Nordic test system, all contingencies are considered for data training. Efficiency of the proposed method for early detection of instability in online operation is evaluated by AdaBoost algorithm, and the obtained results are compared by those of other classifiers.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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".