Sub-hourly forecasting of fire potential using machine learning on time series of surface weather variables
Bibliographic record
Abstract
Background Rapidly developing pre-fire weather conditions contributing to sudden fire outbreaks can have devastating consequences. Accurate short-term forecasting is important for timely evacuations and effective fire suppression measures. Aims This study aims to introduce a novel machine learning-based approach for forecasting fire potential and to test its performance in the Sunshine Coast region of Queensland, Australia, over a period of 15 years from 2002 to 2017. Methods By analysing real-time data from local weather stations at a sub-hourly temporal resolution, we aimed to identify distinct weather patterns occurring hours to days before fires. We trained random forest machine learning models to classify pre-fire conditions. Key results The models achieved high out-of-sample accuracy, with a 47% higher accuracy than the standard fire danger index for the region. When simulating real forecasting conditions, the model anticipated 75% of the fires (11 out of 15). Conclusions This method provides objective, quantifiable information, enhancing the precision and effectiveness of fire warning systems. Implications The proposed forecasting approach supports decision-makers in implementing timely evacuations and effective fire suppression measures, ultimately reducing the impact of fires.
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.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
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".