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.
翻译:旅游目的地预测在许多应用中是一个日益重要的领域,例如旅行规划、自主驾驶和电动车辆。尽管这个问题可以自然地在在线学习模式中解决,因为数据是按顺序得出的,但大多数研究都倾向于考虑离线设置。在本文中,我们提出了一个统一的在线环境旅行目的地预测框架,适合在线培训和在线预测。为此,我们开发了两种组合算法,并将它们纳入这个问题的两个在线预测模型中。我们调查了一个真实世界数据集的组合算法和预测模型的不同配置。我们证明,与离线设置相比,集群和整个框架都产生了一致的结果。最后,我们提出了一个新的遗憾指标,用于评估整个在线框架,比较离线对应框架。这一指标使得有可能将错误预测的来源与集群或预测模型联系起来。我们使用这一指标表明,拟议的方法与真实基本分布的概率相仿照,但比所有基线的遗憾要低。