Mapping Bus and Stream Travel Time Using Machine Learning Approaches
Bibliographic record
Abstract
Collection of travel time data has always been a strenuous task, especially on Indian roads, due to the highly mixed traffic conditions and the absence of rigid driving characteristics. Travel time data collection methods such as on-board GPS devices and Wi-Fi scanners have their own feasibility issues. The GPS devices cannot be installed on all private vehicles, and Wi-Fi scanners cannot be set up at each and every road corridor. However, many transit agencies of Indian cities are installing GPS units in their public transport buses, making them a rich source of data. These buses travel all over the network and record the travel time and location information of vehicles at a certain interval, which can become the best and reliable source of traffic data under such conditions. The only limitation with this data is that the buses differ greatly from the rest of the vehicles in terms of vehicle characteristics, freedom of driving, effect of bus-stops, etc. So, a viable solution is to model and link the stream and bus travel times. Based on this, the present study proposes a method to map bus travel times with stream travel times using machine learning techniques, namely, Gradient Boosting Method and Support Vector Machines. Preliminary analysis showed that a nonlinear relationship exists between the travel times, and other factors like peak/off-peak hours, day of the week, etc. Results show that the proposed methods can efficiently map bus travel times with stream travel times with an average MAPE of 20% and perform better than existing approaches such as linear regression and artificial neural networks.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.003 |
| 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.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".