2019
DOI: 10.3390/ijerph16030334
|View full text |Cite
|
Sign up to set email alerts
|

Predicting Future Driving Risk of Crash-Involved Drivers Based on a Systematic Machine Learning Framework

Abstract: The objective of this paper is to predict the future driving risk of crash-involved drivers in Kunshan, China. A systematic machine learning framework is proposed to deal with three critical technical issues: 1. defining driving risk; 2. developing risky driving factors; 3. developing a reliable and explicable machine learning model. High-risk (HR) and low-risk (LR) drivers were defined by five different scenarios. A number of features were extracted from seven-year crash/violation records. Drivers’ two-year p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 36 publications
(18 citation statements)
references
References 35 publications
0
18
0
Order By: Relevance
“…In order to identify the HR e-bike riders based on the machine learning methods, a number of features were developed. As for the demographics, the age groups were divided into four categories based on exclusive class intervals, namely, teenagers (<18 years old), young-aged riders (18~35 years old), middle-aged riders (35~65 years old), and old-aged riders (>65 years old), according to previous literature [ 25 ].…”
Section: Methodsmentioning
confidence: 99%
“…In order to identify the HR e-bike riders based on the machine learning methods, a number of features were developed. As for the demographics, the age groups were divided into four categories based on exclusive class intervals, namely, teenagers (<18 years old), young-aged riders (18~35 years old), middle-aged riders (35~65 years old), and old-aged riders (>65 years old), according to previous literature [ 25 ].…”
Section: Methodsmentioning
confidence: 99%
“…This includes combining stumps with an enhancement program [ 24 ]. The random forest (RF) of a boosting procedure to combine stumps of trees belongs to a “bagging” algorithm [ 25 ], which has already been widely used in biological medicine researches [ 26 , 27 ], especially in the diagnosis of diabetes [ 11 , 12 ]; AdaBoost with a decision tree (AdaBoost) [ 28 ] and an extreme gradient boosting decision tree (XGBoost) [ 29 ] belong to “boosting” algorithms, and they had better performance than a decision tree in the prediction and classification [ 30 32 ]. In this study, LR- and tree-based models were used.…”
Section: Introductionmentioning
confidence: 99%
“…Lim et al [20] proposed online sequential ELM update algorithm based on recursive least squares (Online sequential ELM, OSELM). Inspired by this idea, we first train a set of KELM sub-learner models based on historical data sets.…”
Section: Kelm Classifier Online Updating Incrementallymentioning
confidence: 99%