【24h】

On a Clustering-Based Approach for Traffic Sub-area Division

机译:论交通小区划分的基于聚类方法

获取原文

摘要

Traffic sub-area division is an important problem in traffic management and control. This paper proposes a clustering-based approach to this problem that takes into account both temporal and spatial information of vehicle trajectories. Considering different orders of magnitude in time and space, we employ a z-score scheme for uniformity and design an improved density peak clustering method based on a new density definition and similarity measure to extract hot regions. We design a distribution-based partitioning method that employs k-means algorithm to split hot regions into a set of traffic sub-areas. For performance evaluation, we develop a traffic sub-area division criterium based on the S_Dbw indicator and the classical Davies-Bouldin index in the literature. Experimental results illustrate that the proposed approach improves traffic sub-area division quality over existing methods.
机译:交通小区部门是交通管理和控制中的重要问题。本文提出了一种基于聚类的方法来考虑车辆轨迹的时间和空间信息。考虑到不同时间和空间的不同级,我们采用Z-Score方案来均匀性,并基于新的密度定义和相似度测量来提取热区域的改进的密度峰聚类方法。我们设计一种基于分发的分区方法,采用K-Means算法将热区域分成一组流量子区域。对于绩效评估,我们基于S_DBW指标和文献中的古典Davies-Bouldin指数开发了交通子区域划分标准。实验结果表明,所提出的方法通过现有方法提高了交通子区域划分质量。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号