DBSCAN clustering method is applied to identify severe Traffic Accident (TA) hotpots on roads

A. Gershtein, A. Terekhov
{"title":"DBSCAN clustering method is applied to identify severe Traffic Accident (TA) hotpots on roads","authors":"A. Gershtein, A. Terekhov","doi":"10.32603/2071-2340-2021-1-46-58","DOIUrl":null,"url":null,"abstract":"DBSCAN clustering method is applied to identify severe Traffic Accident (TA) hotpots on roads. The research examines severe TA, defined as those that led to human damage (injury or death), in the city of Newton, MA and in the entire state of Massachusetts, USA from 2013 to 2018. DBSCAN algorithm was also applied to network-constrained uniformly distributed over road network data to locate threshold in number of points per cluster so that all more populated clusters identified in real data can be treated as statistically significant. For DBSCAN algorithm two types of distance metrics, Euclidean and over Network, were compared. It is found that both distances are equivalent on scale of 10 meters, which justifies hybrid approach to clustering: using Network distance only to generate uniformly distributed points needed for Monte-Carlo simulations. All clustering can be performed using Euclidean distances which is much faster and more memory efficient. Subsequent years analysis demonstrates the extend that hotspots identified are stable and occur consecutively for several years and hence may possess predictive value.","PeriodicalId":319537,"journal":{"name":"Computer Tools in Education","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Tools in Education","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.32603/2071-2340-2021-1-46-58","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

DBSCAN clustering method is applied to identify severe Traffic Accident (TA) hotpots on roads. The research examines severe TA, defined as those that led to human damage (injury or death), in the city of Newton, MA and in the entire state of Massachusetts, USA from 2013 to 2018. DBSCAN algorithm was also applied to network-constrained uniformly distributed over road network data to locate threshold in number of points per cluster so that all more populated clusters identified in real data can be treated as statistically significant. For DBSCAN algorithm two types of distance metrics, Euclidean and over Network, were compared. It is found that both distances are equivalent on scale of 10 meters, which justifies hybrid approach to clustering: using Network distance only to generate uniformly distributed points needed for Monte-Carlo simulations. All clustering can be performed using Euclidean distances which is much faster and more memory efficient. Subsequent years analysis demonstrates the extend that hotspots identified are stable and occur consecutively for several years and hence may possess predictive value.
采用DBSCAN聚类方法识别道路上的严重交通事故热点
采用DBSCAN聚类方法识别道路上的严重交通事故热点。该研究调查了2013年至2018年美国马萨诸塞州牛顿市和整个马萨诸塞州的严重TA,定义为导致人类损害(受伤或死亡)的TA。将DBSCAN算法应用于均匀分布在路网数据上的网络约束,以每簇的点数为阈值,使得在真实数据中识别出的所有人口较多的簇都具有统计显著性。对于DBSCAN算法,比较了欧几里得和over Network两种类型的距离度量。我们发现这两个距离在10米的尺度上是相等的,这证明了混合聚类方法的合理性:使用网络距离只产生蒙特卡罗模拟所需的均匀分布的点。所有的聚类都可以使用欧几里得距离来执行,这种距离更快,更节省内存。后续年份分析表明,确定的热点范围稳定且连续发生数年,因此可能具有预测价值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信