首页> 外文会议>International conference on knowledge-based and intelligent information and engineering systems;KES 2010 >Modified K-Means Clustering for Travel Time Prediction Based on Historical Traffic Data
【24h】

Modified K-Means Clustering for Travel Time Prediction Based on Historical Traffic Data

机译:基于历史交通数据的改进的K均值聚类用于出行时间预测

获取原文

摘要

Prediction of travel time has major concern in the research domain of Intelligent Transportation Systems (ITS). Clustering strategy can be used as a powerful tool of discovering hidden knowledge that can easily be applied on historical traffic data to predict accurate travel time. In our Modified K-means Clustering (MKC) approach, a set of historical data is portioned into a group of meaningful sub-classes (also known as clusters) based on travel time, frequency of travel time and velocity for a specific road segment and time group. With the use of same set of historical travel time estimates, comparison is also made to the forecasting results of other three methods: Successive Moving Average (SMA), Chain Average (CA) and Naive Bayesian Classification (NBC) method. The results suggest that the travel times for the study periods could be predicted by the proposed method with the minimum Mean Absolute Relative Error (MARE).
机译:在智能交通系统(ITS)的研究领域中,旅行时间的预测是主要关注的问题。聚类策略可以用作发现隐藏知识的强大工具,这些知识可以轻松应用于历史交通数据以预测准确的出行时间。在我们的改进的K均值聚类(MKC)方法中,基于行进时间,行进时间的频率和特定路段的速度,将一组历史数据分成一组有意义的子类(也称为聚类)。时间组。使用同一组历史旅行时间估计值,还与其他三种方法的预测结果进行了比较:连续移动平均数(SMA),链平均数(CA)和朴素贝叶斯分类(NBC)方法。结果表明,可以通过提出的方法以最小的平均绝对相对误差(MARE)预测研究时间的旅行时间。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号