Shallow Landslide Prediction Using a Novel Hybrid Functional Machine Learning Algorithm
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.
Bibliographic record
Abstract
We used a novel hybrid functional machine learning algorithm to predict the spatial distribution of landslides in the Sarkhoon watershed, Iran. We developed a new ensemble model which is a combination of a functional algorithm, stochastic gradient descent (SGD) and an AdaBoost (AB) Meta classifier namely ABSGD model to predict the landslides. The model incorporates 20 landslide conditioning factors, which we ranked using the least-square support vector machine (LSSVM) technique. For the modeling, we considered 98 landslide locations, of which 70% (79) were used for training and 30% (19) for validation processes. Model validation was performed using sensitivity, specificity, accuracy, the root mean square error (RMSE) and the area under the receiver operatic characteristic (AUC) curve. We also used soft computing benchmark models, including SGD, logistic regression (LR), logistic model tree (LMT) and functional tree (FT) algorithms for model validation and comparison. The selected conditioning factors were significant in landslide occurrence but distance to road was found to be the most important factor. The ABSGD model (AUC= 0.860) outperformed the LR (0.797), SGD (0.776), LMT (0.740) and FT (0.734) models. Our results confirm that the combined use of a functional algorithm and a Meta classifier prevents over-fitting, reduces noise and enhances the power prediction of the individual SGD algorithm for the spatial prediction of landslides.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| 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 it