MétaCan
Menu
Back to cohort
Record W2589115084 · doi:10.1109/tpwrs.2017.2669839

Prediction of the Transient Stability Boundary Based on Nonparametric Additive Modeling

2017· article· en· W2589115084 on OpenAlexaff
Jiaqing Lv, M. Pawlak, U.D. Annakkage

Bibliographic record

VenueIEEE Transactions on Power Systems · 2017
Typearticle
Languageen
FieldEngineering
TopicPower System Optimization and Stability
Canadian institutionsUniversity of Manitoba
FundersUniversity of Manchester
KeywordsNonparametric statisticsElectric power systemTransient (computer programming)Boundary (topology)Stability (learning theory)Context (archaeology)Kernel (algebra)Curse of dimensionalityMathematicsFault (geology)Computer scienceControl theory (sociology)Mathematical optimizationAlgorithmPower (physics)Artificial intelligenceMachine learningStatistics

Abstract

fetched live from OpenAlex

This paper applies modern statistical nonparametric methodology to the problem of prediction of the transient stability boundary of large-scale power engineering systems. The stability issue is characterized by the critical clearing time (CCT) that is employed to determine whether a precontingency steady-state condition is stable for a given fault in the power system. The multidimensional mapping between the precontingency steady-state conditions and the corresponding CCT is modeled as an additive structure of one-dimensional functions. Nonparametric kernel estimation methods are applied to the assumed additive model yielding the boundary prediction algorithm that is easily interpretable and avoids the curse of dimensionality. The precision of our additive nonlinear modeling is demonstrated in the context of fault prediction of the 470-bus power network. For the specified fault type, we demonstrate a stronger prediction accuracy compared to other large-scale machine learning methods that have been used for the transient stability boundary problem so far.

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 imitation

Not 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.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.011
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.011
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.

Opus teacher head0.027
GPT teacher head0.220
Teacher spread0.193 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations35
Published2017
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Power SystemsSame topicPower System Optimization and StabilityFrench-language works237,207