Bus running time prediction using a statistical pattern recognition technique
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
Abstract Given that real-time bus arrival information is viewed positively by passengers of public transit, it is useful to enhance the methodological basis for improving predictions. Specifically, data captured and communicated by intelligent systems are to be supplemented by reliable predictive travel time. This paper reports a model for real-time prediction of urban bus running time that is based on statistical pattern recognition technique, namely locally weighted scatter smoothing. Given a pattern that characterizes the conditions for which bus running time is being predicted, the trained model automatically searches through the historical patterns which are the most similar to the current pattern and on that basis, the prediction is made. For training and testing of the methodology, data retrieved from the automatic vehicle location and automatic passenger counter systems of OC Transpo (Ottawa, Canada) were used. A comparison with other methodologies shows enhanced predictive capability.
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.000 | 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