Fuzzy Approach in Rail Track Degradation Prediction
Bibliographic record
Abstract
Rail transport authorities around the world have been facing a significant challenge when predicting rail infrastructure maintenance work. With the restrictions on financial support, the rail transport authorities are in pursuit of improved modern methods, which can provide a precise prediction of rail maintenance timeframe. The expectation from such a method is to develop models to minimise the human error that is strongly related to manual prediction. Such models will help rail transport authorities in understanding how the track degradation occurs at different conditions (e.g., rail type, rail profile) over time. They need a well-structured technique to identify the precise time when rail tracks fail to minimise the maintenance cost/time. The rail track characteristics that have been collected over the years will be used in developing a degradation prediction model for rail tracks. Since these data have been collected in large volumes and the data collection is done both electronically and manually, it is possible to have some errors. Sometimes these errors make it impossible to use the data in prediction model development. An accurate model can play a key role in the estimation of the long-term behaviour of rail tracks. Accurate models can increase the efficiency of maintenance activities and decrease the cost of maintenance in long-term. In this research, a short review of rail track degradation prediction models has been discussed before estimating rail track degradation for the curves and straight sections of Melbourne tram track system using Adaptive Network-based Fuzzy Inference System (ANFIS) model. The results from the developed model show that it is capable of predicting the gauge values with R2 of 0.6 and 0.78 for curves and straights, respectively.
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.001 |
| 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.002 | 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".