MétaCan
Menu
Back to cohort
Record W2402355997

Efficient Incremental Smart Grid Data Analytics

2016· article· en· W2402355997 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

VenueEDBT/ICDT Workshops · 2016
Typearticle
Languageen
FieldComputer Science
TopicCloud Computing and Resource Management
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsSmart meterSmart gridComputer scienceContext (archaeology)ComputationElectricityScalabilityPopularityBig dataGridDistributed computingEnergy consumptionEfficient energy useDatabaseReal-time computingData miningAlgorithmEngineeringElectrical engineering
DOInot available

Abstract

fetched live from OpenAlex

Analytical computations over energy data are gaining popularity thanks to the growing adoption of smart electricity meters. Computations in this context range from seemingly straightforward tasks such as calculating monthly bills based on time-of-use pricing, to elaborate building for predictions and recommendations in an eort to reduce peak demand. While research in this promising area is progressing steadily, published algorithms and prototypes have largely avoided the important practical question of how to deal eciently with the incremental nature of energy data, for example per-hour readings produced by smart electricity meters. As a stepping stone towards a comprehensive solution to this problem, we investigate incremental techniques for disaggregating dierent categories of energy consumption, such as base load versus activity load, from hourly smart meter data using the popular \three-line model of Birt et al. Our software prototype, called Insparq, exhibits speedups in excess of 2x for data sets up to tens of GB in size, compared to a naive implementation on top of a conventional scalable batch processing framework.

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.001
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.770
Threshold uncertainty score0.673

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0030.004
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.035
GPT teacher head0.255
Teacher spread0.220 · 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