摘要
非参数回归方法是短时交通流预测常用的方法,但现有非参数回归方法存在预测速度与精度之间的矛盾。为此,提出一种适用于海量历史数据、基于Map Reduce与遗传算法的非参数回归短时交通流预测方法。通过引入Map Reduce并行计算框架,加快K最近邻算法的搜索速度。在数据预处理阶段利用遗传算法优化关键参数的设置,并采用Map Reduce加速参数优化过程,以解决遗传算法迭代运算时间长的问题。实验结果表明,该方法在保证交通流预测精度的前提下,明显提高了预测速度,并且具有较好的可伸缩性。
Non-parameter regression method is widely used in short-term traffic flow forecasting,but there is a contradiction on forecasting accuracy and computational efficiency in that method. This paper proposes an improved shortterm traffic flow forecasting method based on Map Reduce and genetic algorithm in the context of massive historical data.To improve the search speed of K Nearest Neighbor(KNN),a parallel computing framework Map Reduce is used to search the KNN. In data preprocessing stage,genetic algorithm is used to optimize the selection of key parameters,and it accelerates parameter optimization process based on Map Reduce to solve the problem of long iterative operation time for genetic algorithm. Experimental results show that the method has high scalability,and it can increase the searching efficiency significantly while the forecasting accuracy is guaranteed.
出处
《计算机工程》
CAS
CSCD
北大核心
2015年第1期174-179,共6页
Computer Engineering
基金
广东省中国科学院全面战略合作基金资助项目(2012B091100266)
广州市科技计划基金资助项目(2010Y1-C041)
广州市科技计划科技支撑基金资助项目(09A11040726)
关键词
交通流预测
非参数回归
K最近邻搜索
遗传算法
Map
Reduce编程模型
并行计算
traffic flow forecasting
non-parametric regression
K Nearest Neighbor(KNN)search
genetic algorithm
Map Reduce programming model
parallel computing