首页> 外文期刊>IEEE Transactions on Intelligent Transportation Systems >T-DesP: Destination Prediction Based on Big Trajectory Data
【24h】

T-DesP: Destination Prediction Based on Big Trajectory Data

机译:T-DesP:基于大轨迹数据的目的地预测

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

摘要

Destination prediction is very important in location-based services such as recommendation of targeted advertising location. Most current approaches always predict destination according to existing trip based on history trajectories. However, no existing work has considered the difference between the effects of passing-by locations and the destination in history trajectories, which seriously impacts the accuracy of predicted results as the destination can indicate the purpose of traveling. Meanwhile, the temporal information of history trajectories in destination prediction plays an important role. On one hand, the history trajectories in different periods also differ in the influence, e.g., the history trajectories from last week can reflect the status quo more accurately than the history trajectories two years ago. On the other hand, the history trajectories in different time slots reflect different facts of traffic and moving habits of people, e.g., visiting a restaurant in the daytime and visiting a bar at night. Although a huge amount of history trajectories can be achieved in the era of big data, it is still far from covering all the query trajectories since a road network is widely distributed and trajectory data is sparse. The temporal sensitivity of history trajectories highlights the sparsity problem even more. Therefore, we propose a novel model to solve the aforementioned problems. The model is comprised of two modules: trajectory learning and destination prediction. In the module of trajectory learning, a novel method called the mirror absorbing Markov chain model is proposed for modeling the trajectories for isolating the destination. We build a transition tensor to deduce the transition probability between each location pair in a particular time slot. To address the data sparsity problem, we fill the missing values in transition tensor through a context-aware tens- r decomposition approach. In the module of destination prediction, an absorbing tensor is derived from the filled transition tensor, and the theoretical model is established for destination prediction. The experiments prove the effectiveness and efficiency of .
机译:目的地预测在基于位置的服务(例如目标广告位置的推荐)中非常重要。大多数当前方法总是根据历史轨迹根据现有行程预测目的地。但是,目前尚无研究考虑过境轨迹与目的地在历史轨迹中的影响之间的差异,这严重影响了预测结果的准确性,因为目的地可以指示旅行的目的。同时,历史轨迹的时间信息在目的地预测中起着重要的作用。一方面,不同时期的历史轨迹在影响上也不同,例如,上周的历史轨迹比两年前的历史轨迹更能准确地反映现状。另一方面,不同时隙中的历史轨迹反映出人们的交通和移动习惯的不同事实,例如,白天白天逛餐厅,晚上逛酒吧。尽管在大数据时代可以实现大量的历史轨迹,但是由于道路网络分布广泛且轨迹数据稀疏,因此它还远不能覆盖所有查询轨迹。历史轨迹的时间敏感性更加突出了稀疏性问题。因此,我们提出了一种新颖的模型来解决上述问题。该模型由两个模块组成:轨迹学习和目的地预测。在轨迹学习的模块中,提出了一种称为镜像吸收马尔可夫链模型的新方法,以对孤立目标的轨迹进行建模。我们建立一个过渡张量,以推断特定时隙中每个位置对之间的过渡概率。为了解决数据稀疏性问题,我们通过上下文感知的张量分解方法来填充过渡张量中的缺失值。在目的地预测模块中,从填充的过渡张量导出吸收张量,并建立用于目的地预测的理论模型。实验证明了该方法的有效性和有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号