Driving Style Recognition under Connected Circumstance Using a Supervised Hierarchical Bayesian Model
Bibliographic record
Abstract
In recent years, the automated driving system has been known to be one of the most popular research topics of artificial intelligence (AI) and intelligent transportation system (ITS). The journey experience on automated vehicles and the intelligent automated driving system could be improved by individualization driving understanding. Although previous studies have proposed methods for driving styles understanding, the individualization driving classification has not been addressed thoroughly. Therefore, in this study, a supervised method is proposed to understand driving behavioral structure and the latent driving styles by incorporating the prior knowledge. Firstly, a novel method is established for driving behavioral encoding and raw driving data mining. Then, the Labeled Latent Dirichlet Allocation (LLDA) is proposed to understand the latent driving styles from individual driving with driving behaviors. Finally, the Safety Pilot Model Deployment (SPMD) data are used to validate the performance of the proposed model. Experimental results show that the proposed model uncovers latent driving styles effectively and shows good agreement to real situations, which provides theoretical guidance on driving behavior recognition for better individual experience on automated driving vehicles.
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.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.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".