A Cloud-Based Framework for Creating Scalable Machine Learning Models Predicting Building Energy Consumption from Digital Twin Data
Bibliographic record
Abstract
Digital Twins (DTs) of buildings can generate large volumes of dynamic data from various sources (e.g., sensors and IoT devices), enabling real-time representation of physical building states in a digital environment. Although machine learning (ML) techniques are increasingly used to predict building energy consumption from this DT data, existing approaches often lack scalability in handling data growth (data scalability) and/or adapting to evolving data patterns (model scalability). This study aims to address both drawbacks by developing a scalable cloud-based framework for the prediction of the building energy consumption. A key contribution to the field is the inclusion of a “monitoring and maintenance” module, which continuously evaluates model performance and triggers retraining only when needed. This enables timely adaptation of the ML model while avoiding unnecessary retraining and the associated computational costs. The framework was implemented and tested in a case study of a commercial building for 90 days, demonstrating its applicability. In a practical setting, the developed model could detect anomalies in time when the accuracy declined below the set threshold (70%) for five days and prevented unnecessary retraining of ML models. The findings support the feasibility of using cloud-based approaches to implement scalable ML models for energy prediction in buildings.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".