User Preferential Tour Recommendation Based on POI-Embedding Methods

• URL: http://arxiv.org/abs/2103.02464v1
• Date: Wed, 3 Mar 2021 15:18:23 GMT
• Title: User Preferential Tour Recommendation Based on POI-Embedding Methods
• Authors: Ngai Lam Ho, Kwan Hui Lim
• Abstract summary: We propose an algorithm to recommend personalized tours using POI-embedding methods. Our recommendation algorithm will generate a sequence of POIs that optimize time and locational constraints. Preliminary experimental results show that our algorithm is able to recommend a relevant and accurate itinerary.
• Score: 0.624399544884021
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Tour itinerary planning and recommendation are challenging tasks for tourists in unfamiliar countries. Many tour recommenders only consider broad POI categories and do not align well with users' preferences and other locational constraints. We propose an algorithm to recommend personalized tours using POI-embedding methods, which provides a finer representation of POI types. Our recommendation algorithm will generate a sequence of POIs that optimizes time and locational constraints, as well as user's preferences based on past trajectories from similar tourists. Our tour recommendation algorithm is modelled as a word embedding model in natural language processing, coupled with an iterative algorithm for generating itineraries that satisfies time constraints. Using a Flickr dataset of 4 cities, preliminary experimental results show that our algorithm is able to recommend a relevant and accurate itinerary, based on measures of recall, precision and F1-scores.

Related papers

• To the Globe (TTG): Towards Language-Driven Guaranteed Travel Planning [54.9340658451129]
  To the Globe (TTG) is a real-time demo system that takes natural language requests from users and translates it to symbolic form. The overall system takes 5 seconds to reply to the user request with guaranteed itineraries. When evaluated by users, TTG achieves consistently high Net Promoter Scores (NPS) of 35-40% on generated itinerary.
  arXiv  Detail & Related papers  (2024-10-21T19:30:05Z)
• Pre-trained Language Model and Knowledge Distillation for Lightweight Sequential Recommendation [51.25461871988366]
  We propose a sequential recommendation algorithm based on a pre-trained language model and knowledge distillation. The proposed algorithm enhances recommendation accuracy and provide timely recommendation services.
  arXiv  Detail & Related papers  (2024-09-23T08:39:07Z)
• Utilizing Language Models for Tour Itinerary Recommendation [2.5128274367283785]
  Tour itinerary recommendation involves planning a sequence of relevant Point-of-Interest (POIs) This paper explores the use of language models for the task of tour itinerary recommendation and planning.
  arXiv  Detail & Related papers  (2023-11-21T05:15:56Z)
• SBTRec- A Transformer Framework for Personalized Tour Recommendation Problem with Sentiment Analysis [6.753123338256321]
  SBTRec is a BERT-based Trajectory Recommendation with sentiment analysis. It learns users' preferences and satisfaction levels from reviews and comments about different POIs. It achieves an average F1 score of 61.45%, outperforming baseline algorithms.
  arXiv  Detail & Related papers  (2023-11-18T13:30:01Z)
• BTRec: BERT-Based Trajectory Recommendation for Personalized Tours [6.753123338256321]
  Many tour recommendation tools only take into account a limited number of factors, such as popular Points of Interest (POIs) and routing constraints. We propose an iterative algorithm in this paper, namely: BTREC (BERT-based Trajectory Recommendation), that extends from the POIBERT embedding algorithm to recommend personalized itineraries on POIs. Our recommendation system can create a travel itinerary that maximizes POIs visited, while also taking into account user preferences for categories of POIs and time availability.
  arXiv  Detail & Related papers  (2023-10-30T18:00:26Z)
• POIBERT: A Transformer-based Model for the Tour Recommendation Problem [0.3121997724420106]
  We propose POIBERT, an algorithm for recommending personalized itineraries using the BERT language model on POIs. Our recommendation algorithm is able to generate a sequence of POIs that optimize time and users' preference in POI categories based on past trajectories from similar tourists.
  arXiv  Detail & Related papers  (2022-12-16T12:32:15Z)
• Self-supervised Graph-based Point-of-interest Recommendation [66.58064122520747]
  Next Point-of-Interest (POI) recommendation has become a prominent component in location-based e-commerce. We propose a Self-supervised Graph-enhanced POI Recommender (S2GRec) for next POI recommendation. In particular, we devise a novel Graph-enhanced Self-attentive layer to incorporate the collaborative signals from both global transition graph and local trajectory graphs.
  arXiv  Detail & Related papers  (2022-10-22T17:29:34Z)
• DeepAltTrip: Top-k Alternative Itineraries for Trip Recommendation [4.727697892741763]
  We propose a deep learning-based framework, called DeepAltTrip, that learns to recommend top-k alternative itineraries for given source and destination POIs. For the route generation step, we propose a novel sampling algorithm that can seamlessly handle a wide variety of user-defined constraints.
  arXiv  Detail & Related papers  (2021-09-08T10:36:59Z)
• Attention-based neural re-ranking approach for next city in trip recommendations [77.34726150561087]
  This paper describes an approach to solving the next destination city recommendation problem for a travel reservation system. We propose a two stages approach: an approach for candidates selection and an attention neural network model for candidates re-ranking.
  arXiv  Detail & Related papers  (2021-03-23T11:56:40Z)
• Model Selection in Contextual Stochastic Bandit Problems [51.94632035240787]
  We develop a meta-algorithm that selects between base algorithms. We show through a lower bound that even when one of the base algorithms has $O(sqrtT)$ regret, in general it is impossible to get better than $Omega(sqrtT)$ regret.
  arXiv  Detail & Related papers  (2020-03-03T18:46:34Z)
• Optimistic Policy Optimization with Bandit Feedback [70.75568142146493]
  We propose an optimistic trust region policy optimization (TRPO) algorithm for which we establish $tilde O(sqrtS2 A H4 K)$ regret for previous rewards. To the best of our knowledge, the two results are the first sub-linear regret bounds obtained for policy optimization algorithms with unknown transitions and bandit feedback.
  arXiv  Detail & Related papers  (2020-02-19T15:41:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.