Urban Traffic State Estimation with Online Car-Hailing Data: A Dynamic Tensor-Based Bayesian Probabilistic Decomposition Approach
Bibliographic record
Abstract
Timely and precise traffic state estimation of urban roads is significant for urban traffic management and operation. However, most of the advanced studies focus on building complex deep learning structures to learn the spatiotemporal feature of the urban traffic flow, ignoring improving the efficiency of the traffic state estimation. Considering the benefit of the tensor decomposition, we present a novel urban traffic state estimation based on dynamic tensor and Bayesian probabilistic decomposition. Firstly, the real-time traffic speed data are organized in the form of a dynamic tensor which contains the spatiotemporal characteristics of the traffic state. Then, a dynamic tensor Bayesian probabilistic decomposition (DTBPD) approach is built by decomposing the dynamic tensor into the outer product of several vectors. Afterward, the Gibbs sampling method is introduced to calibrate the parameters of the DTBPD models. Finally, the real-world traffic speeds data extracted from online car-hailing trajectories are employed to validate the model performance. Experimental results indicate that the proposed model can greatly reduce computational time while maintaining relatively high accuracy. Meanwhile, the DTBPD model outperforms the state-of-the-art models in terms of both single-step-ahead and multistep-ahead traffic state estimation.
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.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| 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".