Finite Mixture of the Hidden Markov Model for Driving Style Analysis
Bibliographic record
Abstract
Analyzing driving style is useful for developing intelligent vehicles. Previous studies usually consider the statistical features (e.g., the means and standard deviations of brake pressure) of the measured driving data or manually define the number of patterns divided by behavior semantics to characterize driving styles. In this paper, we propose a driving style analysis to describe the personalized driving styles from time-series driving data without specifying the levels in advance but by estimating them from the data. First, range, range rate, and acceleration are selected as three feature variables to describe car-following scenarios. Then, the car-following data are normalized to reduce the scale influence of different variables on the segmentation results. The hidden Markov model (HMM) and the finite mixture of the hidden Markov model (MHMM) are adopted to extract behavior semantics. Compared with the HMM, the MHMM can identify the heterogeneity of data and then provide more reasonable primitive driving patterns. Based on the results, this study uses the K-means clustering to label all the driving patterns semantically and identifies a total of 75 different driving patterns. We use the normalized frequency distributions to describe personalized driving behavior characteristics, and similarity evaluations of driving styles are applied using the Kolmogorov–Smirnov test. The proposed approach in this paper is useful for exploring the characteristics of driving habits.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 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".