期刊文献+

基于K-邻域非参数回归短时交通流预测方法 被引量:37

Short-term traffic flow forecasting based on K-nearest neighbors non-parametric regression
在线阅读 下载PDF
导出
摘要 实时、准确的短时交通流预测是交通控制与诱导中的一个关键问题和难点.非参数回归是解决短时交通流预测问题的较好方法,但是案例库生成难和搜索速度慢是其目前实际应用的两大障碍.为此,提出一种基于平衡二叉树的K-邻域非参数回归(KNN-NPR)的短时交通流预测方法,采用聚类方法和平衡二叉树结构建立案例数据库,以提高预测精度和满足实时性要求.给出了预测示例说明了方法的有效性. Real-time and accurate short-term traffic flow forecasting has become critical in traffic control and guidance. Non-parametric regression is a good way to solve the problem. But the foundation of case database and the search speed are two obstacles for application. A KNN-NPR( K-nearest neighbors non-parametric regression) method based on balanced binary tree to forecast short-term traffic flow is presented. In order to improve forecasting precision and meet real-time reqirement, clustering methods and balanced binary tree are adopted to build case database. An example is given to show its availability.
出处 《系统工程学报》 CSCD 北大核心 2009年第2期178-183,共6页 Journal of Systems Engineering
基金 北京市科学技术委员会科技计划资助项目(D07020601400705)
关键词 短时交通流预测 非参数回归 聚类 平衡二叉树 short-term traffic flow forecasting NPR ( non-parametric regression) clustering balanced binary tree
  • 相关文献

参考文献7

  • 1Smith B L, Demetsky M J. Short-term traffic flow prediction models-A comparison of neural network and nonparametric regression approaches [ A ]. In: Proceedings of IEEE International Conference on Systems [C]. San Antonio, TX, USA: IEEE, 1994. 1706-1709.
  • 2Smith B L, Dem etskym J. Traffic flow forecasting: Comparison of modeling approaches [ J ]. Journal of Transportation Engineering, 1997, 123 (4) : 261-266.
  • 3宫晓燕,汤淑明.基于非参数回归的短时交通流量预测与事件检测综合算法[J].中国公路学报,2003,16(1):82-86. 被引量:92
  • 4Smith B L, Oswald R K. Effects of parameter selection on forecast accuracy and execution time in non-parameric regression [ A ]. In: Proceedings of 2000 IEEE Intelligent Transportation Systems Conference [ C ]. Dearborn, MI, USA: IEEE, 2000. 252-257
  • 5何中胜,刘宗田,庄燕滨.基于数据分区的并行DBSCAN算法[J].小型微型计算机系统,2006,27(1):114-116. 被引量:16
  • 6马帅,王腾蛟,唐世渭,杨冬青,高军.一种基于参考点和密度的快速聚类算法[J].软件学报,2003,14(6):1089-1095. 被引量:108
  • 7张弛.城市交通流计算机微观仿真系统的设计与实现[D].天津:天津大学,1997.

二级参考文献18

  • 1周水庚,周傲英,金文,范晔,钱卫宁.FDBSCAN:一种快速 DBSCAN算法(英文)[J].软件学报,2000,11(6):735-744. 被引量:42
  • 2Han JW, Kambr M. Data Mining Concepts and Techniques. Beijing: Higher Education Press, 2001. 145-176.
  • 3Kaufan L, Rousseeuw PJ. Finding Groups in Data: an Introduction to Cluster Analysis. New York: John Wiley & Sons, 1990.
  • 4Ester M, Kriegel HP, Sander J, Xu X. A density based algorithm for discovering clusters in large spatial databases with noise. In:Simoudis E, Han JW, Fayyad UM, eds. Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining.Portland: AAAI Press, 1996. 226-231.
  • 5Guha S, Rastogi R, Shim K. CURE: an efficient clustering algorithm for large databases. In: Haas LM, Tiwary A, eds. Proceedings of the ACM SIGMOD International Conference on Management of Data. Seattle: ACM Press, 1998. "73-84.
  • 6Agrawal R, Gehrke J, Gunopolos D, Raghavan P. Automatic subspace clustering of high dimensional data for data mining application. In: Haas LM, Tiwary A, eds. Proceedings of the ACM SIGMOD International Conference on Management of Data.Seattle: ACM Press, 1998.94-105.
  • 7Alexandros N, Yannis T,Yannis M. C^2P: clustering based on closest pairs. In: Apers PMG, Atzeni P, Ceri S, Paraboschi S,Ramamohanarao K, Snodgrass RT, eds. Proceedings of the 27th International Conference on Very Large Data Bases. Roma:Morgan Kaufmann Publishers, 2001. 331-340.
  • 8Berchtold S, Bohm C, Kriegel H-P. The pyramid-technique: towards breaking the curse of dimensionality. In: Haas LM, Tiwary A,eds. Proceedings of the ACM SIGMOD International Conference on Management of Data. Seattle: ACM Press, 1998. 142- 153.
  • 9Yu C, Ooi BC, Tan K-L, Jagadish HV. Indexing the distance: an efficient method to KNN processing. In: Apers PMG, Atzeni P,Ceri S, Paraboschi S, Ramamohanarao K, Snodgrass RT, eds. Proceedings of the 27th International Conference on Very Large Data Bases. Roma: Morgan Kaufmann Publishers, 2001. 421--430.
  • 10Beachmann N et al. The R"-tree :An efficient and robust access method for points and rectanggles [C]. In: Proc of ACM SIGMOD Int'l Conf on Management of Data. Atlantic :ACM Press,1998,73-84.

共引文献213

同被引文献253

引证文献37

二级引证文献245

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部