Journal of South China University of Technology (Natural Science Edition) ›› 2015, Vol. 43 ›› Issue (12): 114-118,126.doi: 10.3969/j.issn.1000-565X.2015.12.016

• Traffic & Transportation Engineering • Previous Articles     Next Articles

A Distance-Based Weighted Pattern Recognition Algorithm for Traffic Flow Forecasting

Liu Shu-qing  Xu Jian-min  Lu Kai  Ma Ying-ying   

  1. School of Civil Engineering and Transportation,South China University of Technology,Guangzhou 510640,Guangdong,China
  • Received:2014-11-24 Revised:2015-03-03 Online:2015-12-25 Published:2015-11-01
  • Contact: 刘树青(1987-),女,博士生,主要从事城市智能交通信息工程与控制研究. E-mail:toliusq@foxmail.com
  • About author:刘树青(1987-),女,博士生,主要从事城市智能交通信息工程与控制研究.
  • Supported by:
    Supported by the National Natural Science Foundation of China(51308227,61174184)

Abstract: In the short-term traffic flow forecasting based on the weighted traffic pattern recognition algorithm(WPRA),the weights of different historical state values are distinguished according to the time-interval characteristics of historical traffic patterns,but in practical application,the subjective setting of the weight values reduces the reliability of this method. In this paper,by analyzing the core principle of the data-driven non-parametric-regression traffic flow forecasting algorithm and by improving the forecasting algorithm aiming at the uncertainty of the time-interval-characteristic weights of WPRA,a distance-based weighted pattern recognition algorithm (DWPRA) is proposed to forecast the short-term traffic flow. Finally,the root mean square error between real traffic flows and predicted ones is introduced to verify the proposed algorithm. The results show that,at the same neighbor number K,the root mean square error of DWPRA is 4.8% ~7.1% lower than that of WPRA,which proves the effectiveness of DWPRA.

Key words: pattern recognition, short-term traffic flow forecasting, K-nearest neighbor search, distance weight, root mean square error