{"title":"基于分类树和回归树的短期交通量预测","authors":"Yanyan Xu, Qingjie Kong, Yuncai Liu","doi":"10.1109/IVS.2013.6629516","DOIUrl":null,"url":null,"abstract":"Accurate short-term traffic flow prediction plays a fundamental role in intelligent transportation systems (ITS), e.g. advanced traffic management systems (ATMS). To generate accurate short-term traffic volume, nonparametric models have gained credit from quantities of researchers. On the basis of the common thought that future traffic states can be predicted according to the similar states in the historical traffic data, this paper presents a novel nonparametric-model-based method to predict the short-term traffic volume. The applied nonparametric model is the classification and regression trees (CART) model. In the application, the CART model first classifies the historical traffic states into plentiful categories. Afterwards, the linear regression model is built corresponding to each traffic state pattern. Finally, the model predicts the short-term traffic state through clustering the current state vector into the most congenial historical pattern and regression model. In the experiments, the proposed method is tested by using the 15 minutes average traffic volumes on freeways and is compared with the classic nonparametric methods k-nearest neighbors (k-NN) model, and the parametric method Kalman filter model. The results indicate that the CART-based prediction method outperforms the k-NN and Kalman filter methods in both the mean absolute percentage error and the mean absolute scaled error.","PeriodicalId":251198,"journal":{"name":"2013 IEEE Intelligent Vehicles Symposium (IV)","volume":"238 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":"{\"title\":\"Short-term traffic volume prediction using classification and regression trees\",\"authors\":\"Yanyan Xu, Qingjie Kong, Yuncai Liu\",\"doi\":\"10.1109/IVS.2013.6629516\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Accurate short-term traffic flow prediction plays a fundamental role in intelligent transportation systems (ITS), e.g. advanced traffic management systems (ATMS). To generate accurate short-term traffic volume, nonparametric models have gained credit from quantities of researchers. On the basis of the common thought that future traffic states can be predicted according to the similar states in the historical traffic data, this paper presents a novel nonparametric-model-based method to predict the short-term traffic volume. The applied nonparametric model is the classification and regression trees (CART) model. In the application, the CART model first classifies the historical traffic states into plentiful categories. Afterwards, the linear regression model is built corresponding to each traffic state pattern. Finally, the model predicts the short-term traffic state through clustering the current state vector into the most congenial historical pattern and regression model. In the experiments, the proposed method is tested by using the 15 minutes average traffic volumes on freeways and is compared with the classic nonparametric methods k-nearest neighbors (k-NN) model, and the parametric method Kalman filter model. The results indicate that the CART-based prediction method outperforms the k-NN and Kalman filter methods in both the mean absolute percentage error and the mean absolute scaled error.\",\"PeriodicalId\":251198,\"journal\":{\"name\":\"2013 IEEE Intelligent Vehicles Symposium (IV)\",\"volume\":\"238 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"33\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE Intelligent Vehicles Symposium (IV)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IVS.2013.6629516\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Intelligent Vehicles Symposium (IV)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IVS.2013.6629516","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Short-term traffic volume prediction using classification and regression trees
Accurate short-term traffic flow prediction plays a fundamental role in intelligent transportation systems (ITS), e.g. advanced traffic management systems (ATMS). To generate accurate short-term traffic volume, nonparametric models have gained credit from quantities of researchers. On the basis of the common thought that future traffic states can be predicted according to the similar states in the historical traffic data, this paper presents a novel nonparametric-model-based method to predict the short-term traffic volume. The applied nonparametric model is the classification and regression trees (CART) model. In the application, the CART model first classifies the historical traffic states into plentiful categories. Afterwards, the linear regression model is built corresponding to each traffic state pattern. Finally, the model predicts the short-term traffic state through clustering the current state vector into the most congenial historical pattern and regression model. In the experiments, the proposed method is tested by using the 15 minutes average traffic volumes on freeways and is compared with the classic nonparametric methods k-nearest neighbors (k-NN) model, and the parametric method Kalman filter model. The results indicate that the CART-based prediction method outperforms the k-NN and Kalman filter methods in both the mean absolute percentage error and the mean absolute scaled error.