Search Results for author:
Found 6 papers, 1 papers with code
Utilizing Language Models for Tour Itinerary Recommendation
As a RS problem, it is heavily related to problem or filtering or ranking a subset of POIs that are relevant to a user and recommending it as part of an itinerary.
SBTRec- A Transformer Framework for Personalized Tour Recommendation Problem with Sentiment Analysis
In this paper, we propose the SBTRec algorithm: a BERT-based Trajectory Recommendation with sentiment analysis, for recommending personalized sequences of POIs as itineraries.
BTRec: BERT-Based Trajectory Recommendation for Personalized Tours
An essential task for tourists having a pleasant holiday is to have a well-planned itinerary with relevant recommendations, especially when visiting unfamiliar cities.
POIBERT: A Transformer-based Model for the Tour Recommendation Problem
Our recommendation algorithm is able to generate a sequence of POIs that optimizes time and users' preference in POI categories based on past trajectories from similar tourists.
A Simple Algorithm for the Constrained Sequence Problems
In this paper, we present a simple algorithm to solve the constrained longest common subsequence problem in $O(n \cdot m \cdot r)$ time and show that the constrained longest common subsequence problem is equivalent to a special case of the constrained multiple sequence alignment problem which can also be solved.
Multiple Sequence Alignment
Data Structures and Algorithms
User Preferential Tour Recommendation Based on POI-Embedding Methods
Tour itinerary planning and recommendation are challenging tasks for tourists in unfamiliar countries.
