首页> 外文期刊>Journal of intelligent & fuzzy systems: Applications in Engineering and Technology >Uncertainty prediction method for traffic flow based on K-nearest neighbor algorithm
【24h】

Uncertainty prediction method for traffic flow based on K-nearest neighbor algorithm

机译:基于k最近邻邻算法的交通流量的不确定性预测方法

获取原文
获取原文并翻译 | 示例
           

摘要

In order to overcome the problem of low fitting between traffic uncertainty prediction results and actual values in existing research methods, a traffic flow uncertainty prediction method based on K-nearest neighbor algorithm is proposed. The original database, classification center database, k-nearest neighbor database and intermediate search database are used to construct the database needed in the prediction process. Based on the database, multivariate linear regression is used to assign weights to state variables, and k-nearest neighbor algorithm and Kalman filter are used to update the weights to adapt to the uncertainties of traffic flow until the predicted values are obtained, and the uncertainties of traffic flow are predicted. The experimental results show that the maximum average absolute error and average relative error of the proposed method are 0.018 and 0.02, respectively. Compared with the traditional method, the proposed method has higher overall prediction accuracy, higher fitting degree, and is feasible.
机译:为了克服现有研究方法中交通不确定性预测结果和实际值之间的低拟合的问题,提出了一种基于k最近邻域算法的业务流量不确定性预测方法。原始数据库,分类中心数据库,k最近邻居数据库和中间搜索数据库用于构造预测过程中所需的数据库。基于数据库,多变量线性回归用于将权重分配给状态变量,并且k最近邻算法和卡尔曼滤波器用于更新权重,以适应流量流的不确定性,直到获得预测值,以及不确定性预测交通流量。实验结果表明,所提出的方法的最大平均绝对误差和平均相对误差分别为0.018和0.02。与传统方法相比,所提出的方法具有更高的总体预测精度,拟合程度较高,是可行的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号