MétaCan
Menu
Back to cohort

Optimal Harnessing Machine Learning for Monitoring and Predictive Maintenance in Electrical Transformers

2024· article· en· W4401110905 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicNon-Destructive Testing Techniques
Canadian institutionsUniversité du Québec en Abitibi-Témiscamingue
Fundersnot available
KeywordsPredictive maintenanceTransformerComputer scienceCondition monitoringReliability engineeringEngineeringElectrical engineeringVoltage

Abstract

fetched live from OpenAlex

Electrical transformers are indispensable in the seamless transmission and distribution of electricity; however, they are not immune to faults. Such malfunctions, though infrequent, can lead to substantial repair costs and more critically, to significant downtime in power systems. Consequently, there is a pressing need to seek maintenance alternatives that go beyond traditional approaches. This research delves into the application of Machine Learning (ML) methods for the early detection of transformer faults. Leveraging a dataset enriched with seven vital indicators of transformer health, various ML algorithms were meticulously evaluated. The results of this study reveal that the Random Forest algorithm surpasses others in predicting faults with the greatest accuracy, demonstrating its potential as a reliable tool for predictive maintenance in the power industry.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.919
Threshold uncertainty score0.504

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.011
GPT teacher head0.252
Teacher spread0.241 · 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

Quick stats

Citations3
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicNon-Destructive Testing TechniquesFrench-language works237,207