检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:吴迪[1] 倪静[1] Di Wu;Jing Ni(Business School,University of Shanghai for Science&Technology,Shanghai,200093,China)
出 处:《管理科学与研究(中英文版)》2023年第4期37-49,共13页Management Science and Research
摘 要:准确合理的出租车需求预测能平衡乘客出行需要且缓解城市交通拥堵,但出租车需求是动态的,它会随着时间的周期性和空间的相关性变化而变化。使用神经网络的出租车需求预测模型广受关注,但目前大部分模型对需求数据的时空间特征提取有效性不足,缺乏筛选数据特征的能力,使得预测结果不够贴合现实情况。对此,本文提出AttConvLSTM预测模型。首先通过k-means聚类和Granger因果关系检验寻找与检验时空相关性,再结合影响需求的气候和节假日等外部因素,运用卷积长短期记忆网络(ConvLSTM)融合注意力机制捕获及评估时空间特征,对特征进行选择性注意,从而提高预测结果的精度与可靠性。最终选取纽约市出租车需求数据进行实验,结果表明该模型相比多种知名基线模型表现出更高的准确度和稳定性。Accurate and reasonable taxi demand forecasting can balance passenger travel needs and reduce urban traffic congestion,but taxi demand is dynamic and changes with time cycles and spatial correlations.Taxi demand forecasting models using neural networks are widely popular,but most of the current models are not effective enough in extracting the spatio-temporal features of the demand data and lack the ability to filter the data features,making the forecasting results not close to the real situation.In response,this paper proposes the Att-ConvLSTM prediction model.First,find and test spatio-temporal correlation through kmeans clustering and Granger causality test,then combine external factors such as climate and holidays that affect demand,use convolutional long and short-term memory network(ConvLSTM)to fuse attention mechanism to capture and evaluate spatiotemporal features,and selectively pay attention to features,so as to improve the accuracy and reliability of prediction results.New York City taxi demand data were selected for the experiment,and the results show that the model exhibits higher accuracy and stability compared to a variety of well-known baseline models.
关 键 词:出租车需求预测 神经网络 卷积长短期记忆网络 注意力机制 GRANGER因果关系检验 K-MEANS聚类
分 类 号:TP3[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.171