arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.04520cs.LGcs.AI
收藏

在线旅游目的地预测的统一框架

A Unified Framework for Online Trip Destination Prediction

Chalmers University of Technology(查尔姆斯理工大学)

Victor Eberstein, Jonas Sjöblom, Nikolce Murgovski, Morteza Haghir Chehreghani

摘要:

出行目的地预测在出行规划、自动驾驶和电动汽车等许多应用中越来越重要。尽管这个问题可以在数据以顺序方式到达的在线学习范例中自然地解决,但大多数研究都考虑了离线设置。在本文中,我们提出了一个统一的框架,行程目的地预测在线设置,这是适合在线训练和在线预测。为此,我们开发了两个聚类算法,并将它们集成到两个在线预测模型中。我们研究了真实世界数据集上的聚类算法和预测模型的不同配置。我们表明,无论是聚类和整个框架产生一致的结果相比,离线设置。最后,我们提出了一个新的遗憾度量评估整个在线框架相比,其离线对应。该度量使得有可能将错误预测的源与聚类或预测模型相关联。使用这个度量,我们表明,所提出的方法收敛到一个概率分布类似于真正的潜在分布,具有较低的遗憾比所有的基线。

英文摘要:

Trip destination prediction is an area of increasing importance in many applications such as trip planning, autonomous driving and electric vehicles. Even though this problem could be naturally addressed in an online learning paradigm where data is arriving in a sequential fashion, the majority of research has rather considered the offline setting. In this paper, we present a unified framework for trip destination prediction in an online setting, which is suitable for both online training and online prediction. For this purpose, we develop two clustering algorithms and integrate them within two online prediction models for this problem. We investigate the different configurations of clustering algorithms and prediction models on a real-world dataset. We demonstrate that both the clustering and the entire framework yield consistent results compared to the offline setting. Finally, we propose a novel regret metric for evaluating the entire online framework in comparison to its offline counterpart. This metric makes it possible to relate the source of erroneous predictions to either the clustering or the prediction model. Using this metric, we show that the proposed methods converge to a probability distribution resembling the true underlying distribution with a lower regret than all of the baselines.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑