MétaCan
Menu
Back to cohort
Record W2766173675 · doi:10.1109/icbdaci.2017.8070800

Improved short-term electricity load forecasting using extreme learning machines

2017· article· en· W2766173675 on OpenAlexaboutno aff
Shom Prasad Das, Vidiyala Laharika, N Sangita Achray

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMachine Learning and ELM
Canadian institutionsnot available
Fundersnot available
KeywordsArtificial neural networkTerm (time)Computer scienceBenchmark (surveying)Extreme learning machineElectricityElectric power systemArtificial intelligenceField (mathematics)Operator (biology)Electricity marketMachine learningPower (physics)Engineering

Abstract

fetched live from OpenAlex

Short term forecasting is an essential tool in energy companies to take the decisions about power generation, transmission and day-to-day utility operations. A number of techniques are used in the field of Short Term Load Forecasting (STLF), like statistical and artificial neural network technique. This paper proposes an extreme learning machine based STLF technique that considers relative difference in percentage of load(RDL) at different intervals as one of the main characteristics of the system load. Here for analysis, historical data are taken from Independent Electricity System Operator(IESO) for Ontario province. Forecasting results obtained by this new approach have been presented and compared with the benchmark neural network based model like NN-GA, NN-PSO and NN-ABC, which confirms its applicability in forecasting domain.

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.000
metaresearch head score (Gemma)0.001
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: Methods · Consensus signal: Methods
Teacher disagreement score0.007
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
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.069
GPT teacher head0.295
Teacher spread0.226 · 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
GenreMethods

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

Citations2
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicMachine Learning and ELMFrench-language works237,207