An analysis of causative factors for road accidents using partition around medoids and hierarchical clustering techniques

Author:

Manasa Pendyala1,Ananth Pragya1,Natarajan Priyadarshini2ORCID,Somasundaram K.1,Rajkumar E. R.2,Ravichandran Kattur Soundarapandian1ORCID,Balasubramanian Venkatesh2,Gandomi Amir H.34ORCID

Affiliation:

1. Department of Mathematics Amrita School of Physical Sciences, Amrita Vishwa Vidyapeetham Coimbatore India

2. RBG Labs, Department of Engineering Design Indian Institute of Technology Madras Chennai India

3. Faculty of Engineering & Information Technology University of Technology Sydney Ultimo New South Wales Australia

4. University Research and Innovation Center (EKIK) Obuda University Budapest Hungary

Abstract

AbstractInsufficient progress in the development of national highways and state highways, coupled with a lack of public awareness regarding road safety, has resulted in prevalent traffic congestion and a high rate of accidents. Understanding the dominant and contributing factors that may influence road traffic accident severity is essential. This study identified the primary causes and the most significant target‐specific causative factors for road accident severity. A modified partitioning around medoids model determined the dominant road accident features. These clustering algorithms will extract hidden information from the road accident data and generate new features for our implementation. Then, the proposed method is compared with the other state‐of‐the‐art clustering techniques with three performance metrics: the silhouette coefficient, the Davies–Bouldin index, and the Calinski–Harabasz index. This article's main contribution is analyzing six different scenarios (different angles of the problem) concerning grievous and non‐injury accidents. This analysis provides deeper insights into the problem and can assist transport authorities in Tamil Nadu, India, in deriving new rules for road traffic. The output of different scenarios is compared with hierarchical clustering, and the overall clustering of the proposed method is compared with other clustering algorithms. Finally, it is proven that the proposed method outperforms other recently developed techniques.

Publisher

Wiley

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Unveiling Hidden Patterns: Clustering Algorithms on C Code embedding;2024 IEEE 9th International Conference for Convergence in Technology (I2CT);2024-04-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3