2016
DOI: 10.1007/s12524-015-0500-2
|View full text |Cite
|
Sign up to set email alerts
|

Identification of Black Spots on Highway with Kernel Density Estimation Method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0
1

Year Published

2018
2018
2025
2025

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 33 publications
(15 citation statements)
references
References 6 publications
0
14
0
1
Order By: Relevance
“…SI was integrated in KDE method to investigate accident hotspots on some highways in India. However, temporal-spatial integration was not mentioned (Sandhu et al 2016), despite of using SI in the hotspot study (Iyanda 2019).…”
Section: Introductionmentioning
confidence: 99%
“…SI was integrated in KDE method to investigate accident hotspots on some highways in India. However, temporal-spatial integration was not mentioned (Sandhu et al 2016), despite of using SI in the hotspot study (Iyanda 2019).…”
Section: Introductionmentioning
confidence: 99%
“…Based on the calculated weights for various types of road sections, the safety entropy values of the 46 road sections were calculated using (7) and (8). For example, the eight sections of road A have safety entropy values of 0.0436, 0.0278, 0.0318, 0.0385, 0.0439, 0.0358, 0.0277, and 0.0204.…”
Section: Calculation Of the Rtse Values Of The Road Sectionsmentioning
confidence: 99%
“…Additionally, the silhouette coefficients for various numbers of clusters were calculated. e silhouette coefficients for k of 2, 3, and 4 were found to be 0.44, 0.37, (1) int r ⟵ k-means number of clusters (2) For int t � 1 to r − 1 (3) int a t ⟵ Safety entropy value of the center of the t th cluster (4) int b t ⟵ Safety entropy value of the center of the (t + 1)th cluster (5) int s t ⟵ Sum of the data in the tth and (t + 1) th clusters (6) int f � 1 (7) For float e tf � a t to b t (8) int c tf ⟵ Volume of data in the tth cluster that is misclassified (9) int d tf ⟵ Volume of data in the (t + 1)th cluster that is misclassified (10) g tf � 1 − ((c tf + d tf )/s t )//Calculation of accuracy (11) e tf � etf + 0.01 (12) B t (f, 1: 2) � [e tf , g tf ]// e threshold and accuracy are stored in the matrix B t (13) f � f + 1 (14) End for (15) C t ⟵ Generation of the threshold corresponding to the highest accuracy (16) End for (17) C � [C 1 , C 2 , . .…”
Section: Determination Of the Number Of Risk Levelsmentioning
confidence: 99%
See 1 more Smart Citation
“…KDE is the strongest in terms of statistical performance -on par with EB -and has been researched extensively [12]. KDE is particularly useful for HSID when combined with other methods like repeatability analysis [13], statistical analysis [14], and K-means clustering [15].…”
Section: A Hotspot Identification and Analysismentioning
confidence: 99%