Data-Driven Approach for Modeling the Nonlane-Based Mixed Traffic Conditions
Bibliographic record
Abstract
The diverse nature of vehicle categories and the resultant lane discipline in mixed (heterogeneous) traffic cause complex spatial interactions. As a result, the driving behavior process in mixed traffic conditions is meaningfully different, where both longitudinal and lateral movements of the vehicles continuously occur. Under prevailing homogeneous traffic conditions in developed countries, driving behavior is partially discrete, where following longitudinal behavior and outboard lane-change models can model traffic behavior. However, the established car-following and lane-change models cannot be directly used in shaping mixed traffic conditions. Such conditions also warrant the use of high-quality microlevel vehicular trajectory data. Accordingly, realizing this need, vehicular trajectory data for different traffic flow conditions were developed. The data were used to extract the parameters required for modeling the vehicles’ positions using machine learning algorithms. Three established supervised machine learning algorithms (k-NN, random forest, and regression tree) and deep learning are selected to model mixed traffic conditions. The parameters which influence longitudinal and lateral movements are identified using Spearman correlation analysis. Furthermore, simulation runs are performed using the python language. The performance of the algorithms is evaluated both at the microscopic and macroscopic levels using relevant traffic indicators. The results show that a deep learning model and k-NN tend to replicate better-mixed traffic conditions than random forest and regression trees.
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.001 |
| 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.002 | 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".