Skip to content
naulon
Not checkedNot checked for notices yet.

A multi‐attention dynamic graph convolution network with cost‐sensitive learning approach to road‐level and minute‐level traffic accident prediction

Mingyao Wu, Hongwei Jia, Dan Luo and 3 more

IET Intelligent Transport Systems · 2023

doi:10.1049/itr2.12254 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Abstract Traffic accident prediction on road levels and minute levels plays an important role in optimizing public safety and improving traffic infrastructure. However, there are still some challenges in this work. Firstly, the dynamic factors (e.g. traffic flow) affecting traffic accidents make the road network have dynamic spatio‐temporal dependency, which leads to biased prediction results. Secondly, the occurrence of traffic accidents is a small probability event, which brings about zero‐inflation problem. To address aforementioned problems, the authors propose a Multi‐Attention Dynamic Graph Convolution Network with Cost Sensitive Learning approach (MADGCN). Specifically, in the spatial dimension, MADGCN calculates the attention scores of different types of dynamic factors through attention mechanism to simulate the different influence degrees of different factors, and models dynamic inter‐road spatial correlation through Graph Convolution Network (GCN). In the temporal aspect, MADGCN adaptively models the dynamic temporal correlations through self‐attention blocks. In addition, MADGCN improves the loss function based on cost‐sensitive learning strategy to increase the cost of false classification of positive samples, so as to accurately mine sparse positive samples. Experimental results on two real‐world traffic accident datasets demonstrate the superiority of MADGCN. Compared with the existing state‐of‐the‐art methods, F1‐score of MADGCN on two real‐world traffic accident datasets is improved by 11.61% and 9.15%, respectively.

Abstract licence: CC BY-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.