Prediction model of passenger transfer volume between scenic spots based on clustering and dynamic Bayesian network

Qiuxia Sun, Guoxiang Chu, Qing Li, Xiuyan Jia
{"title":"Prediction model of passenger transfer volume between scenic spots based on clustering and dynamic Bayesian network","authors":"Qiuxia Sun, Guoxiang Chu, Qing Li, Xiuyan Jia","doi":"10.1117/12.2652773","DOIUrl":null,"url":null,"abstract":"In order to reduce the risks caused by congestion to scenic spot management and tourist safety, a dynamic Bayesian network model based on K-means++ clustering is proposed to realize the prediction of tourist transfer volume between scenic spots. Firstly, the K-means++ method is used to cluster the tourist transfer volume between scenic spots, we select the best number of clustering by the elbow rule, and the grade interval is determined by clustering results. Secondly, we consider the passenger transfer volume and tourist flow as the nodes of the dynamic Bayesian network, which can estimate the probability of tourist transfer from the upstream scenic spots to the target scenic spot, and the tourist volume of the target scenic spot is predicted. Finally, the confusion matrix is used to verify the validity of the proposed model. The case study shows: 1.) The prediction accuracy of the model can reach about 96%, which indicates that the model is suitable for tourist flow prediction. 2.) Compared to ARIMA, SVR, K-means + BN, and K-means + DBN, the proposed model has better prediction accuracy. 3.) The Bayesian network model outperforms deep learning models in interpretability.","PeriodicalId":116712,"journal":{"name":"Frontiers of Traffic and Transportation Engineering","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Frontiers of Traffic and Transportation Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2652773","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In order to reduce the risks caused by congestion to scenic spot management and tourist safety, a dynamic Bayesian network model based on K-means++ clustering is proposed to realize the prediction of tourist transfer volume between scenic spots. Firstly, the K-means++ method is used to cluster the tourist transfer volume between scenic spots, we select the best number of clustering by the elbow rule, and the grade interval is determined by clustering results. Secondly, we consider the passenger transfer volume and tourist flow as the nodes of the dynamic Bayesian network, which can estimate the probability of tourist transfer from the upstream scenic spots to the target scenic spot, and the tourist volume of the target scenic spot is predicted. Finally, the confusion matrix is used to verify the validity of the proposed model. The case study shows: 1.) The prediction accuracy of the model can reach about 96%, which indicates that the model is suitable for tourist flow prediction. 2.) Compared to ARIMA, SVR, K-means + BN, and K-means + DBN, the proposed model has better prediction accuracy. 3.) The Bayesian network model outperforms deep learning models in interpretability.
基于聚类和动态贝叶斯网络的景区间客运量预测模型
为了降低拥堵给景区管理和游客安全带来的风险,提出了一种基于k -means++聚类的动态贝叶斯网络模型,实现了景区间游客流动量的预测。首先,采用k - meme++方法对景区间的客流量进行聚类,根据肘部规则选择最佳聚类数,并根据聚类结果确定分级区间;其次,将旅客转客量和旅游流量作为动态贝叶斯网络的节点,估计上游景区的游客向目标景区转移的概率,预测目标景区的游客数量;最后,利用混淆矩阵验证了所提模型的有效性。案例分析表明:1)模型的预测精度可达96%左右,表明该模型适用于旅游流量预测。2)。与ARIMA、SVR、K-means + BN和K-means + DBN相比,该模型具有更好的预测精度。3)。贝叶斯网络模型在可解释性方面优于深度学习模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信