Time-Aware Multivariate Nearest Neighbor Regression Methods for Traffic Flow Prediction

被引:66
作者
Dell'Acqua, Pietro [1 ]
Bellotti, Francesco [2 ]
Berta, Riccardo [2 ]
De Gloria, Alessandro [2 ]
机构
[1] Univ Insubria, Dept Sci & High Technol, I-22100 Como, Italy
[2] Univ Genoa, Dept Elect Elect Telecommun Engn & Naval Architec, I-16145 Genoa, Italy
关键词
Traffic flow prediction; nearest neighbor regression; multivariate analysis; context awareness; pattern recognition algorithm; Bayesian networks; ARIMA;
D O I
10.1109/TITS.2015.2453116
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
Traffic flow prediction is a fundamental functionality of intelligent transportation systems. After presenting the state of the art, we focus on nearest neighbor regression methods, which are data-driven algorithms that are effective yet simple to implement. We try to strengthen their efficacy in two ways that are little explored in literature, i.e., by adopting a multivariate approach and by adding awareness of the time of the day. The combination of these two refinements, which represents a novelty, leads to the definition of a new class of methods that we call time-aware multivariate nearest neighbor regression (TaM-NNR) algorithms. To assess this class, we have used publicly available traffic data from a California highway. Computational results show the effectiveness of such algorithms in comparison with state-of-the-art parametric and non-parametric methods. In particular, they consistently perform better than their corresponding standard univariate versions. These facts highlight the importance of context elements in traffic prediction. The ideas presented here may be further investigated considering more context elements (e.g., weather conditions), more complex road topologies (e.g., urban networks), and different types of prediction methods.
引用
收藏
页码:3393 / 3402
页数:10
相关论文
共 51 条
[1]  
[Anonymous], GRAPH THEORY ITS APP
[2]  
[Anonymous], 1999, Transportation Research Record, DOI DOI 10.3141/1678-22
[3]  
[Anonymous], 1999, STRUCTURAL TIME SERI
[4]  
[Anonymous], P IEEE 15 INT ITSC
[5]  
[Anonymous], P ITS WORLD C BEIJ C
[6]  
Atkeson CG, 1997, ARTIF INTELL REV, V11, P11, DOI 10.1023/A:1006559212014
[7]  
Bolshinsky Ella., 2012, TRAFFIC FLOW FORECAS
[8]   A LIMITED MEMORY ALGORITHM FOR BOUND CONSTRAINED OPTIMIZATION [J].
BYRD, RH ;
LU, PH ;
NOCEDAL, J ;
ZHU, CY .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1995, 16 (05) :1190-1208
[9]   Multi-Dimensional Traffic Flow Time Series Analysis with Self-Organizing Maps [J].
Tsinghua National Laboratory for Information Science and Technology, Department of Automation, Tsinghua University, Beijing, 100084, China .
Tsinghua Sci. Tech., 2008, 2 (220-228) :220-228
[10]   Signal Processing in Large Systems [J].
Couillet, Romain ;
Debbah, Merouane .
IEEE SIGNAL PROCESSING MAGAZINE, 2013, 30 (01) :24-39