孙梦婷, 魏海平, 李星滢, 徐立. 利用CART分类树分类检测交通拥堵点[J]. 武汉大学学报 ( 信息科学版), 2022, 47(5): 683-692. DOI: 10.13203/j.whugis20190288
引用本文: 孙梦婷, 魏海平, 李星滢, 徐立. 利用CART分类树分类检测交通拥堵点[J]. 武汉大学学报 ( 信息科学版), 2022, 47(5): 683-692. DOI: 10.13203/j.whugis20190288
SUN Mengting, WEI Haiping, LI Xingying, XU Li. Classification and Detection of Traffic Congestion Points Using CART[J]. Geomatics and Information Science of Wuhan University, 2022, 47(5): 683-692. DOI: 10.13203/j.whugis20190288
Citation: SUN Mengting, WEI Haiping, LI Xingying, XU Li. Classification and Detection of Traffic Congestion Points Using CART[J]. Geomatics and Information Science of Wuhan University, 2022, 47(5): 683-692. DOI: 10.13203/j.whugis20190288

利用CART分类树分类检测交通拥堵点

Classification and Detection of Traffic Congestion Points Using CART

  • 摘要: 交通拥堵检测是城市交通管理工作的重点和难点之一,现有的拥堵检测以路段为单位,不利于拥堵时空演变规律信息的提取,且检测内容大多只涉及拥堵程度,缺少对拥堵类型的识别。基于CART(classification and regression tree)分类树算法,提出一种以路段点为检测单元的拥堵点分类检测方法,该方法可根据路段平均行驶速度实时检测拥堵点及其类型。首先,将路段等距离划分后映射为路段点,根据时空维路况异常规则和异常模式,以路段点为单元分析了4种拥堵类型的时空演变模式;其次,在路段路况检测的基础上,提取路段点路况时空序列,根据不同类型的拥堵模式对路况时空序列进行分类标记;然后,选取4种速度指标作为样本属性集合,按照属性集合提取各路段点在各时段的速度,以此作为决策树学习的数据集;最后,基于CART分类树算法,采用交叉验证的方式训练出最优模型,使其达到最佳的泛化能力。与支持向量机(support vector machine, SVM)分类模型进行比较,实验结果表明,该方法在分类检测交通拥堵点时具有较高的正确率和召回率,且分类检测时效性较好。

     

    Abstract:
      Objectives  Traffic congestion detection is one of the key points and difficulties of urban traffic management. The existing congestion detection methods are based on road sections, which is not conducive to the extraction of spatiotemporal evolution information of congestion. Moreover, most of the detection only involves the degree of congestion but lacks the congestion type identification. With the classification and regression tree (CART) algorithm, this paper proposes a method for the classification and detection of traffic congestion points, which takes the road section point as the detection unit. In the practical application of this method, congestion points and their categories can be detected in real time according to the average running speed on the road section.
      Methods  Firstly, the road section is divided at a specific interval and mapped to be road section points. According to the abnormal rules and patterns of spatiotemporal road conditions, the spatiotemporal evolution patterns of four congestion types are analyzed with road section points as units. Secondly, the spatial and temporal sequence of road conditions of road section points is extracted on the basis of the road condition detection of road sections, and the spatial and temporal sequence of road conditions is classified and labeled according to different congestion types. Thirdly, four speed indexes are selected to constitute the attribute set of samples, and the speed of each road section point at each peri‍od is extracted according to the attribute set, which forms the dataset of decision tree learning. Finally, with the CART algorithm, the optimal model is obtained by the training with cross-validation to achieve the best generalization ability.
      Results  This paper proposes a classification and detection method of traffic congestion points based on CART. On one hand, congestion point detection is added to refine the basic unit of congestion detection, and on the other hand, congestion point type detection is also involved. Classification and detection of congestion points is helpful to improve the efficiency of traffic management.
      Conclusions  The proposed method is compared with the support vector machine classification model, and the experimental results show that the method in this paper has higher accuracy, higher recall rate, and better classification and detection timeliness.

     

/

返回文章
返回