Evaluation of liquefaction potential of soil deposits using artificial neural networks
Bibliographic record
Abstract
Purpose In the literature, several empirical methods can be found to predict the occurrence of nonlinear soil liquefaction in soil layers. These methods are limited to the seismic conditions and the parameters used in developing the model. This paper seeks to present General Regression Neural Network (GRNN) model that addresses the collective knowledge built in simplified procedure. Design/methodology/approach The GRNN model incorporates the soil and seismic parameters of the region. It was developed in four phases; identification, collection, implementation, and verification. The data used consisted of 3,895 case records, mostly from the cone penetration test (CPT) results produced from the two major earthquakes that took place in Turkey and Taiwan in 1999. The case records were divided randomly into training, testing and validation datasets. Soil liquefaction decision in terms of seismic demand and seismic capacity is determined by the stress‐based method and strain‐based method, and further tested with the well‐known Chinese criteria. Findings The results produced by the proposed GRNN model explore effectively the complex relationship between the soil and seismic input parameters and further forecast the liquefaction potential with an overall success ratio of 94 percent. Liquefaction decisions were further validated by the SPT, confirming the viability of the SPT‐to‐CPT data conversion, which is the main limitation of most of the simplified methods. Originality/value The proposed GRNN model provides a viable tool to geotechnical engineers to predict seismic condition in sites susceptible to liquefaction. The model can be constantly updated when new data are available, which will improve its predictability.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.002 | 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.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".