GPS-Based Traffic Conditions Classification Using Machine Learning Approaches
Bibliographic record
Abstract
This paper addresses the problem of accurately estimating traffic conditions based on sparse GPS information. GPS data have limited spatial-temporal availability, particularly at a regional scale. Therefore, it lacks reliability to accurately estimate traffic conditions of a transportation network. This study proposes a novel methodology to address this problem. First, instead of estimating traffic conditions on a geographic road segment, traffic conditions are estimated for trip segments, which span multiple road segments. Second, machine learning methods are applied to classify traffic conditions. In this study, traffic conditions are defined as the combination of congestion level and road type. This study develops two machine learning models—a random forest (RF) model and a supervised clustering method—to classify traffic conditions, using trip characteristics such as average speed and acceleration. The two models are compared in relation to their accuracy and computational efficiency. Results show that speed-related trip characteristics, such as average instantaneous speed, are the most important variables for classifying traffic conditions in both methods. In addition, the proportion of idling in a trip is essential in distinguishing the Congested Highway and Uncongested Urban traffic conditions when applying the supervised clustering method. The comparison shows that the RF model has a higher estimation accuracy (81%) than the supervised clustering method (72%). Overall, this study shows that traffic conditions can be determined efficiently even in cases of limited GPS data.
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.001 | 0.001 |
| Bibliometrics | 0.004 | 0.002 |
| 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.001 |
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".