2019
DOI: 10.1080/15472450.2018.1536978
|View full text |Cite
|
Sign up to set email alerts
|

Predicting duration of traffic accidents based on cost-sensitive Bayesian network and weighted K-nearest neighbor

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
8
2

Relationship

1
9

Authors

Journals

citations
Cited by 75 publications
(25 citation statements)
references
References 28 publications
0
25
0
Order By: Relevance
“…Another advantage is its non-parametric nature, making it well suited to analyze nonlinear and complex relationships (Nemes et al, 2006;Abedi et al, 2018). Researchers have used the kNN because of its capacity to predict a large set of attributes simultaneously (e.g., Mittal et al, 2018;Kuang et al, 2019;Lee et al, 2019). Therefore, it is a cost-and time-effective modelling approach to use in spatially extensive regions (Beaudoin et al, 2014).…”
Section: A Ranking Of the Modelsmentioning
confidence: 99%
“…Another advantage is its non-parametric nature, making it well suited to analyze nonlinear and complex relationships (Nemes et al, 2006;Abedi et al, 2018). Researchers have used the kNN because of its capacity to predict a large set of attributes simultaneously (e.g., Mittal et al, 2018;Kuang et al, 2019;Lee et al, 2019). Therefore, it is a cost-and time-effective modelling approach to use in spatially extensive regions (Beaudoin et al, 2014).…”
Section: A Ranking Of the Modelsmentioning
confidence: 99%
“…Therefore, the execution time is fixed and the response time can be directly reflected by the completion time (Figure 8). Because the QoS parameter fault tolerance algorithm in this paper takes into account the completion time of each task and the cumulative attribute of cost, the parameter fault tolerance algorithm at light load is not superior to the timefirst algorithm in time; and as the number of tasks increases, the system throughput the amount is reduced, and the advantage of the scheduling fault-tolerant algorithm is gradually reflected when the complexity is increased [20]. It saves a lot more than the task completion time of the time optimization algorithm.…”
Section: B Results Analysismentioning
confidence: 99%
“…We evaluate PredPRBA by conducting performance comparison with several other typical regression methods, such as Linear Regression (LR) (Jammalamadaka, 2003), K-nearest Neighbor Regression (KNNR) (Kramer, 2011; Kuang et al, 2019), SVM Regression (SVR) (Cherkassky and Ma, 2004), Decision Tree Regression (DTR) (Xu et al, 2005), Random Forest Regression (RFR) (Biau and Devroye, 2010) and Extremely Randomized Regression Trees (ERRT) (Geurts and Louppe, 2011). As shown in Table 6 , we find that PredPRBA performs significantly better than other regression methods for all classes of complexes.…”
Section: Resultsmentioning
confidence: 99%