A Road Hotspots Identification Method Based on Natural Nearest Neighbor Clustering

Qingwen Han, Yingxiang Zhu, Lingqiu Zeng, L. Ye, Xueying He, Xiaoying Liu, Haotian Wu, Qingsheng Zhu
{"title":"A Road Hotspots Identification Method Based on Natural Nearest Neighbor Clustering","authors":"Qingwen Han, Yingxiang Zhu, Lingqiu Zeng, L. Ye, Xueying He, Xiaoying Liu, Haotian Wu, Qingsheng Zhu","doi":"10.1109/ITSC.2015.97","DOIUrl":null,"url":null,"abstract":"During the last decade, the concept of cluster, has become a popular practice in the field of road safety, mainly for the identification of worst performing areas or time slots also known as hotspots. However, current clustering methods used to identify road accident hotspots suffer from various deficiencies at both theoretical and operational level, these include parameter sensitivity, identify difficultly on arbitrary shape, and cluster number's rationality. The objective of this study is to contribute to the ongoing research effort on hotspots identification. Employing the concept of natural neighbor, a new algorithm, named distance threshold based on natural nearest neighbor (DTH3N), is proposed in this paper, striving to minimize the aforementioned deficiencies of the current approaches. Experiment results show that, comparing with existing methods, proposed algorithm presents a better performance on cluster division. Furthermore, this new method can be viewed as an intelligent decision support basis for road safety performance evaluation, in order to prioritize interventions for road safety improvement.","PeriodicalId":124818,"journal":{"name":"2015 IEEE 18th International Conference on Intelligent Transportation Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 18th International Conference on Intelligent Transportation Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITSC.2015.97","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

During the last decade, the concept of cluster, has become a popular practice in the field of road safety, mainly for the identification of worst performing areas or time slots also known as hotspots. However, current clustering methods used to identify road accident hotspots suffer from various deficiencies at both theoretical and operational level, these include parameter sensitivity, identify difficultly on arbitrary shape, and cluster number's rationality. The objective of this study is to contribute to the ongoing research effort on hotspots identification. Employing the concept of natural neighbor, a new algorithm, named distance threshold based on natural nearest neighbor (DTH3N), is proposed in this paper, striving to minimize the aforementioned deficiencies of the current approaches. Experiment results show that, comparing with existing methods, proposed algorithm presents a better performance on cluster division. Furthermore, this new method can be viewed as an intelligent decision support basis for road safety performance evaluation, in order to prioritize interventions for road safety improvement.
基于自然最近邻聚类的道路热点识别方法
在过去的十年中,集群的概念已经成为道路安全领域的一种流行做法,主要用于识别表现最差的区域或时间段,也称为热点。然而,目前用于道路交通事故热点识别的聚类方法在理论和操作层面都存在着参数敏感性、在任意形状上难以识别、聚类数的合理性等诸多不足。本研究的目的是为正在进行的热点识别研究做出贡献。本文利用自然近邻的概念,提出了一种新的基于自然近邻的距离阈值(DTH3N)算法,力求最大限度地减少现有方法的上述不足。实验结果表明,与现有方法相比,本文算法在聚类划分方面具有更好的性能。此外,该方法可作为道路安全绩效评价的智能决策支持基础,以便优先考虑改善道路安全的干预措施。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信