DeepAltTrip: Top-k Alternative Itineraries for Trip Recommendation

• URL: http://arxiv.org/abs/2109.03535v1
• Date: Wed, 8 Sep 2021 10:36:59 GMT
• Title: DeepAltTrip: Top-k Alternative Itineraries for Trip Recommendation
• Authors: Syed Md. Mukit Rashid, Mohammed Eunus Ali, Muhammad Aamir Cheema
• Abstract summary: 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.
• Score: 4.727697892741763
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Trip itinerary recommendation finds an ordered sequence of Points-of-Interest (POIs) from a large number of candidate POIs in a city. In this paper, we propose a deep learning-based framework, called DeepAltTrip, that learns to recommend top-k alternative itineraries for given source and destination POIs. These alternative itineraries would be not only popular given the historical routes adopted by past users but also dissimilar (or diverse) to each other. The DeepAltTrip consists of two major components: (i) Itinerary Net (ITRNet) which estimates the likelihood of POIs on an itinerary by using graph autoencoders and two (forward and backward) LSTMs; and (ii) a route generation procedure to generate k diverse itineraries passing through relevant POIs obtained using ITRNet. For the route generation step, we propose a novel sampling algorithm that can seamlessly handle a wide variety of user-defined constraints. To the best of our knowledge, this is the first work that learns from historical trips to provide a set of alternative itineraries to the users. Extensive experiments conducted on eight popular real-world datasets show the effectiveness and efficacy of our approach over state-of-the-art methods.

Related papers

• Research on Travel Route Planing Problems Based on Greedy Algorithm [0.0]
  Route planning problem based on the greedy algorithm represents a method of identifying the optimal or near-optimal route between a given start point and end point. In this paper, the PCA method is employed initially to downscale the city evaluation indexes, extract the key principal components, and then downscale the data. A route planning algorithm is proposed and optimised based on the greedy algorithm, which provides personalised route customisation according to the different needs of tourists.
  arXiv  Detail & Related papers  (2024-10-17T05:17:01Z)
• 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)
• 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)
• Find a Way Forward: a Language-Guided Semantic Map Navigator [53.69229615952205]
  This paper attacks the problem of language-guided navigation in a new perspective. We use novel semantic navigation maps, which enables robots to carry out natural language instructions and move to a target position based on the map observations. The proposed approach has noticeable performance gains, especially in long-distance navigation cases.
  arXiv  Detail & Related papers  (2022-03-07T07:40:33Z)
• Deep Learning Aided Packet Routing in Aeronautical Ad-Hoc Networks Relying on Real Flight Data: From Single-Objective to Near-Pareto Multi-Objective Optimization [79.96177511319713]
  We invoke deep learning (DL) to assist routing in aeronautical ad-hoc networks (AANETs) A deep neural network (DNN) is conceived for mapping the local geographic information observed by the forwarding node into the information required for determining the optimal next hop. We extend the DL-aided routing algorithm to a multi-objective scenario, where we aim for simultaneously minimizing the delay, maximizing the path capacity, and maximizing the path lifetime.
  arXiv  Detail & Related papers  (2021-10-28T14:18:22Z)
• Divide-and-Conquer for Lane-Aware Diverse Trajectory Prediction [71.97877759413272]
  Trajectory prediction is a safety-critical tool for autonomous vehicles to plan and execute actions. Recent methods have achieved strong performances using Multi-Choice Learning objectives like winner-takes-all (WTA) or best-of-many. Our work addresses two key challenges in trajectory prediction, learning outputs, and better predictions by imposing constraints using driving knowledge.
  arXiv  Detail & Related papers  (2021-04-16T17:58:56Z)
• 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)
• User Preferential Tour Recommendation Based on POI-Embedding Methods [0.624399544884021]
  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.
  arXiv  Detail & Related papers  (2021-03-03T15:18:23Z)
• Exploration in two-stage recommender systems [79.50534282841618]
  Two-stage recommender systems are widely adopted in industry due to their scalability and maintainability. A key challenge of this setup is that optimal performance of each stage in isolation does not imply optimal global performance. We propose a method of synchronising the exploration strategies between the ranker and the nominators.
  arXiv  Detail & Related papers  (2020-09-01T16:52:51Z)

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.