no code implementations • 21 Nov 2023 • Ngai Lam Ho, Kwan Hui Lim
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.
no code implementations • 18 Nov 2023 • Ngai Lam Ho, Roy Ka-Wei Lee, Kwan Hui Lim
In this paper, we propose the SBTRec algorithm: a BERT-based Trajectory Recommendation with sentiment analysis, for recommending personalized sequences of POIs as itineraries.
1 code implementation • 30 Oct 2023 • Ngai Lam Ho, Roy Ka-Wei Lee, Kwan Hui Lim
An essential task for tourists having a pleasant holiday is to have a well-planned itinerary with relevant recommendations, especially when visiting unfamiliar cities.
no code implementations • 16 Dec 2022 • Ngai Lam Ho, Kwan Hui Lim
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.
no code implementations • 4 Mar 2021 • Francis Yuk Lun Chin, Ngai Lam Ho, Alfredo De Santis, S. K. Kim
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
no code implementations • 3 Mar 2021 • Ngai Lam Ho, Kwan Hui Lim
Tour itinerary planning and recommendation are challenging tasks for tourists in unfamiliar countries.