Condition-based monitoring of the rail wheel using logical analysis of data and ant colony optimization
Bibliographic record
Abstract
Purpose In this paper, a data mining approach is proposed for monitoring the conditions leading to a rail wheel high impact load. The proposed approach incorporates logical analysis of data (LAD) and ant colony optimization (ACO) algorithms in extracting patterns of high impact loads and normal loads from historical railway records. In addition, the patterns are employed in establishing a classification model used for classifying unseen observations. A case study representing real-world impact load data is presented to illustrate the impact of the proposed approach in improving railway services. Design/methodology/approach Application of artificial intelligence and machine learning approaches becomes an essential tool in improving the performance of railway transportation systems. By using these approaches, the knowledge extracted from historical data can be employed in railway assets monitoring to maintain the assets in a reliable state and to improve the service provided by the railway network. Findings Results achieved by the proposed approach provide a prognostic system used for monitoring the conditions surrounding rail wheels. Incorporating this prognostic system in surveilling the rail wheels indeed results in better railway services as trips with no-delay or no-failure can be realized. A comparative study is conducted to evaluate the performance of the proposed approach versus other classification algorithms. In addition to the highly interpretable results obtained by the generated patterns, the comparative study demonstrates that the proposed approach provides classification accuracy higher than other common machine learning classification algorithms. Originality/value The methodology followed in this research employs ACO algorithm as an artificial intelligent technique and LDA as a machine learning algorithm in analyzing wheel impact load alarm-collected datasets. This new methodology provided a promising classification model to predict future alarm and a prognostic system to guide the system while avoiding this alarm.
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.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 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.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".