A Joint Context-Aware Embedding for Trip Recommendations

被引:29
|
作者
He, Jiayuan [1 ]
Qi, Jianzhong [1 ]
Ramamohanarao, Kotagiri [1 ]
机构
[1] Univ Melbourne, Sch Comp & Informat Syst, Melbourne, Vic, Australia
基金
澳大利亚研究理事会;
关键词
D O I
10.1109/ICDE.2019.00034
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:292 / 303
页数:12
相关论文
共 50 条
  • [31] Gaussian Process Factorization Machines for Context-aware Recommendations
    Nguyen, Trung V.
    Karatzoglou, Alexandros
    Baltrunas, Linas
    SIGIR'14: PROCEEDINGS OF THE 37TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2014, : 63 - 72
  • [32] Context-Aware Places of Interest Recommendations for Mobile Users
    Baltrunas, Linas
    Ludwig, Bernd
    Peer, Stefan
    Ricci, Francesco
    DESIGN, USER EXPERIENCE, AND USABILITY: THEORY, METHODS, TOOLS AND PRACTICE, PT 1, 2011, 6769 : 531 - 540
  • [33] Random Partition Factorization Machines for Context-Aware Recommendations
    Wang, Shaoqing
    Du, Cuilan
    Zhao, Kankan
    Li, Cuiping
    Li, Yangxi
    Zheng, Yang
    Wang, Zheng
    Chen, Hong
    WEB-AGE INFORMATION MANAGEMENT, PT I, 2016, 9658 : 219 - 230
  • [34] Context-Aware Recommendations with Random Partition Factorization Machines
    Wang S.
    Li C.
    Zhao K.
    Chen H.
    Data Science and Engineering, 2017, 2 (2) : 125 - 135
  • [35] Context-Aware Recommendations Based on Deep Learning Frameworks
    Unger, Moshe
    Tuzhilin, Alexander
    Livne, Amit
    ACM TRANSACTIONS ON MANAGEMENT INFORMATION SYSTEMS, 2020, 11 (02)
  • [36] Context-aware recommendations in the mobile tourist application COMPASS
    van Setten, M
    Pokraev, S
    Koolwaaij, J
    ADAPTIVE HYPERMEDIA AND ADAPTIVE WEB-BASED SYSTEMS, PROCEEDINGS, 2004, 3137 : 235 - 244
  • [37] GPUTENSOR: Efficient tensor factorization for context-aware recommendations
    Zou, Benyou
    Li, Cuiping
    Tan, Liwen
    Chen, Hong
    INFORMATION SCIENCES, 2015, 299 : 159 - 177
  • [38] Supporting context-aware media recommendations for smart phones
    Yu, Zhiwen
    Zhou, Xingshe
    Zhang, Daqing
    Chin, Chung-Yau
    Wang, Xiaohang
    Men, Ji
    IEEE PERVASIVE COMPUTING, 2006, 5 (03) : 68 - 75
  • [39] Applications of user and context-aware recommendations using ontologies
    Naudet, Yannick
    Schwartz, Lou
    Mignon, Sabrina
    Foulonneau, Muriel
    IHM'10: 22EME CONFERENCE FRANCOPHONE SUR L'INTERACTION HOMME-MACHINE, 2010, : 165 - 172
  • [40] Non-dominated differential context modeling for context-aware recommendations
    Zheng, Yong
    APPLIED INTELLIGENCE, 2022, 52 (09) : 10008 - 10021