MétaCan
Menu
Back to cohort
Record W4318764516 · doi:10.1155/2023/7641472

Prediction of Traffic Accident Severity Based on Random Forest

2023· article· en· W4318764516 on OpenAlex
Jianjun Yang, Siyuan Han, Yimeng Chen

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueJournal of Advanced Transportation · 2023
Typearticle
Languageen
FieldEngineering
TopicTraffic Prediction and Management Techniques
Canadian institutionsnot available
Fundersnot available
KeywordsAccident (philosophy)Traffic accidentRanking (information retrieval)Random forestTransport engineeringSpeed limitComputer scienceStatisticsEngineeringArtificial intelligenceMathematics

Abstract

fetched live from OpenAlex

This paper used the data of automobile traffic accidents from 2018 to 2020 in the Chinese National Automobile Accident In-Depth Investigation System. The prediction features of traffic accident severity are innovated. Four accident features that did not participate in the importance ranking were added: accident location, accident form, road information, and collision speed. Eight accident features (engine capacity, hour of day, age of vehicle, month of year, day of week, age band of drivers, vehicle maneuver, and speed limit) have been used in previous studies. Random forest was used to rank the importance of 12 accident features, and 7 important accident features were finally adopted. By comparing the algorithms and optimizing the results, the prediction model of traffic accident degree with higher accuracy is finally obtained.

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.

Full frame distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.715
Threshold uncertainty score0.324

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.010
GPT teacher head0.222
Teacher spread0.212 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it