首页> 外文会议>IEEE International Conference on Data Engineering >A Joint Context-Aware Embedding for Trip Recommendations
【24h】

A Joint Context-Aware Embedding for Trip Recommendations

机译:旅行建议的联合上下文信息嵌入

获取原文

摘要

Trip recommendation is an important location-based service that helps relieve users from the time and efforts for trip planning. It aims to recommend a sequence of places of interest (POIs) for a user to visit that maximizes the user's satisfaction. When adding a POI to a recommended trip, it is essential to understand the context of the recommendation, including the POI popularity, other POIs co-occurring in the trip, and the preferences of the user. These contextual factors are learned separately in existing studies, while in reality, they jointly impact on a user's choice of POI visits. In this study, we propose a POI embedding model to jointly learn the impact of these contextual factors. We call the learned POI embedding a context-aware POI embedding. To showcase the effectiveness of this embedding, we apply it to generate trip recommendations given a user and a time budget. We propose two trip recommendation algorithms based on our context-aware POI embedding. The first algorithm finds the exact optimal trip by transforming and solving the trip recommendation problem as an integer linear programming problem. To achieve a high computation efficiency, the second algorithm finds a heuristically optimal trip based on adaptive large neighborhood search. We perform extensive experiments on real datasets. The results show that our proposed algorithms consistently outperform state-of-the-art algorithms in trip recommendation quality, with an advantage of up to 43% in F_1-score.
机译:旅行推荐是一个重要的基于位置的服务,有助于缓解用户的时间和努力。它旨在为用户推荐一系列感兴趣的地方(POI),以便最大化用户的满意度。在向推荐之旅中添加POI时,必须了解推荐的背景,包括POI人气,在旅途中共同发生的其他POI,以及用户的偏好。这些上下文因素在现有研究中分别学习,而实际上,他们共同影响用户选择POI访问。在这项研究中,我们提出了一个POI嵌入式模型,共同学习这些上下文因素的影响。我们将学习的POI称为嵌入了上下文感知的POI嵌入。为了展示这种嵌入的效果,我们将其应用于给出用户和时间预算的推荐。我们提出了基于我们的上下文感知POI嵌入的两个旅行推荐算法。第一算法通过转换和解决作为整数线性编程问题的行程推荐问题来找到精确的最佳之旅。为了实现高计算效率,第二种算法基于自适应大邻域搜索找到启发式最佳之旅。我们对真实数据集进行了广泛的实验。结果表明,我们所提出的算法在巡回推荐质量方面始终如一地优于最先进的算法,其优势在F_1分数中高达43%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号