Characterizing Heterogeneity in Drivers’ Merging Maneuvers Using Two-Step Cluster Analysis
Bibliographic record
Abstract
In order to investigate the heterogeneity in merging behaviors on freeways, a novel data mining tool, called two-step cluster analysis, is applied to the merging maneuvers (namely, initial speed, merging speed, and merging position). Merging maneuvers of 370 drivers collected from the NGSIM dataset are automatically and optimally segmented into four clusters (Early Merging Drivers at High Speed, Early Merging Drivers at Low Speed, Late Merging Drivers at Low Speed, and Late Merging Drivers at High Speed) by the two-step cluster analysis. Hypothesis test confirms the significant differences in merging maneuvers between different clusters. The clustered data are used to find the best corresponding fitting distributions. Seven distributions (Normal, Log-normal, Student’s <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1"><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:math>, Logistic, Log-Logistic, Gamma, and Weibull) are considered for each cluster and the Kolmogorov-Smirnov test statics are used to select the best fitted distributions. It is found that merging drivers may merge either early or late, under congestion or uncongested traffic condition. Further analysis of merging durations shows that Late Merging Drivers use significantly shorter time than Early Merging Drivers to finish the merging maneuver, no matter if they are at high or at low speed. Hypothesis test of accepted lead gaps and lag gaps indicate that merging drivers are more sensitive to the lag gaps under congestion. The proposed method can automatically identify the heterogeneity in merging drivers and the results obtained in this paper can be used to enhance the accuracy of the merge behavior models in microscopic simulation software.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".