A Machine Learning Approach for Prediction of the Quantity of Mine Waste Rock Drainage in Areas with Spring Freshet
Bibliographic record
Abstract
A new machine learning approach was developed to predict the quantity of mine waste rock drainage using weather data as the inputs. The novelty of the approach is that it includes spring freshet (melting of snow/ice in spring) as an input to the drainage flow rate model. Specifically, the machine learning approach integrates the decision tree algorithm to classify the occurrence or absence of spring freshet and a long short-term memory (LSTM) algorithm to predict the flow rate of mine waste rock drainage. The two algorithms are integrated by using the classification result of spring freshet as an input to the flow rate model. The machine learning approach developed was applied to predict the drainage flow rate at a case study mine in Canada. The model developed was trained with the local weather data as the inputs and the historical monitoring data of drainage flow rate as the target (output). The results show that the decision tree algorithm is able to classify the occurrence or absence of spring freshet with an accuracy of 91%. The inclusion of spring freshet as an input to the flow rate model significantly improves the performance of the flow rate model. The sensitivity tests show that changes in temperature and atmospheric precipitation influence the drainage flow rate.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| 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".