...
首页> 外文期刊>Advances in Mechanical Engineering >Optimal road accident case retrieval algorithm based on k-nearest neighbor:
【24h】

Optimal road accident case retrieval algorithm based on k-nearest neighbor:

机译:基于k近邻的最优道路交通事故案例检索算法:

获取原文

摘要

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.
机译:提出了一种可以帮助交通管理者根据先前的道路交通事故案例做出更准确决策的最佳算法。基于k近邻的算法基于信息熵指标确定每个事故案例特征的权重值,利用两步聚类算法建立道路事故案例检索库,提出了道路事故案例的全局相似度模型。然后,提出了一种新的综合评价指标,称为匹配度。然后,开发了一个原型系统来进行案例检索实验,以验证所提出的道路交通事故案例检索算法的性能。实验结果清楚地证明了这种案例检索算法对于实时道路事故管理的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号