A New Approach to Regional Traffic Estimation for Intelligent Transport Systems
Bibliographic record
Abstract
With the great development of urban transportation systems, immediate urban traffic information has become an essential resource for the public. Traffic estimation is to predict current or future traffic situation (traffic speed and/or volume) in a road or a region of a city, and can benefit our daily life from many aspects, such as routing planning and traffic management. Existing works focus on estimating future traffic for individual road segments from a perspective of fine-grained level. This paper presents a new approach to estimating future traffic from a perspective of coarse-grained level, by which we estimate the traffic situation of a region, instead of an individual road segment. We propose a new concept about regional traffic named Ω-region, which aims to reflect the traffic situation of a region precisely. Two challenges in the regional traffic estimation problem are how to partition the road network into reasonable regions and how to estimate the regional traffic effectively. To address these challenges, first we define reasonable regions Ω-regions with traffic situations so that the all the road segment in the region has similar traffic. Then, we propose a three-phase partition method to divide the road network into Ω-regions based on historical trajectory data. Thirdly, we propose an effective linear-based model to estimate regional traffic. Experimental results on real-world dataset show that our proposed method achieves high performance.
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.003 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.003 | 0.003 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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".