Optimal road accident case retrieval algorithm based on -nearest neighbor
An optimal algorithm which can help traffic managers to make more accurate decisions from previous road accident case knowledge has been proposed. The algorithm based on k -nearest neighbor determines weight value of each accident case feature based on information entropy index, establishes a road a...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
SAGE Publishing
2019-02-01
|
Series: | Advances in Mechanical Engineering |
Online Access: | https://doi.org/10.1177/1687814018824523 |
id |
doaj-fae0ab65f9f64427bdec9ddefd7b3814 |
---|---|
record_format |
Article |
spelling |
doaj-fae0ab65f9f64427bdec9ddefd7b38142020-11-25T02:52:40ZengSAGE PublishingAdvances in Mechanical Engineering1687-81402019-02-011110.1177/1687814018824523Optimal road accident case retrieval algorithm based on -nearest neighborXianyuan Dong0Mingjie Lu1Key Laboratory of Road and Traffic Engineering of the Ministry of Education, Tongji University, Shanghai, P.R. ChinaSchool of Accounting, Shanghai Lixin University of Accounting and Finance, Shanghai, P.R. ChinaAn optimal algorithm which can help traffic managers to make more accurate decisions from previous road accident case knowledge has been proposed. The algorithm based on k -nearest neighbor determines weight value of each accident case feature based on information entropy index, establishes a road accident case retrieval base using two-step cluster algorithm, and proposes a global similarity model of road accident cases. Then, a new comprehensive evaluation index called matching degree is presented. And then, a prototype system is developed to conduct case retrieval experiments to verify the performance of the proposed algorithm for road accident case retrieval. The result of the experiments clearly demonstrates the effectiveness of this case retrieval algorithm for road accident management in real time.https://doi.org/10.1177/1687814018824523 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Xianyuan Dong Mingjie Lu |
spellingShingle |
Xianyuan Dong Mingjie Lu Optimal road accident case retrieval algorithm based on -nearest neighbor Advances in Mechanical Engineering |
author_facet |
Xianyuan Dong Mingjie Lu |
author_sort |
Xianyuan Dong |
title |
Optimal road accident case retrieval algorithm based on -nearest neighbor |
title_short |
Optimal road accident case retrieval algorithm based on -nearest neighbor |
title_full |
Optimal road accident case retrieval algorithm based on -nearest neighbor |
title_fullStr |
Optimal road accident case retrieval algorithm based on -nearest neighbor |
title_full_unstemmed |
Optimal road accident case retrieval algorithm based on -nearest neighbor |
title_sort |
optimal road accident case retrieval algorithm based on -nearest neighbor |
publisher |
SAGE Publishing |
series |
Advances in Mechanical Engineering |
issn |
1687-8140 |
publishDate |
2019-02-01 |
description |
An optimal algorithm which can help traffic managers to make more accurate decisions from previous road accident case knowledge has been proposed. The algorithm based on k -nearest neighbor determines weight value of each accident case feature based on information entropy index, establishes a road accident case retrieval base using two-step cluster algorithm, and proposes a global similarity model of road accident cases. Then, a new comprehensive evaluation index called matching degree is presented. And then, a prototype system is developed to conduct case retrieval experiments to verify the performance of the proposed algorithm for road accident case retrieval. The result of the experiments clearly demonstrates the effectiveness of this case retrieval algorithm for road accident management in real time. |
url |
https://doi.org/10.1177/1687814018824523 |
work_keys_str_mv |
AT xianyuandong optimalroadaccidentcaseretrievalalgorithmbasedonnearestneighbor AT mingjielu optimalroadaccidentcaseretrievalalgorithmbasedonnearestneighbor |
_version_ |
1724728408568496128 |