Learning Hierarchical Spatial Tasks with Visiting Relations for Next POI Recommendation

Abstract

Sparsity is an established problem for the next Point-of-Interest (POI) recommendation task, where it hinders effective learning of user preferences from the User-POI matrix. However, learning multiple hierarchically related spatial tasks, and visiting relations between users and POIs, can help to alleviate this sparsity problem. In this article, we propose our Hierarchical Multi-Task Graph Recurrent Network (HMT-GRN) approach, which alleviates the sparsity problem by learning different User-Region matrices of lower sparsities in a multi-task setting. We then perform a Hierarchical Beam Search (HBS) on the different region and POI distributions to hierarchically reduce the search space with increasing spatial granularity and predict the next POI. Our HBS provides efficiency gains by reducing the search space, resulting in speedups of 5 to 7 times over an exhaustive approach. In addition, we propose a selectivity layer to predict if the next POI has been visited before by the user to balance between personalization and exploration. Further, we propose a novel Joint Triplet Loss Learning (JTLL) module to learn visited and unvisited relations between users and POIs for the recommendation task. Experimental results on two real-world Location-Based Social Network (LBSN) datasets show that our proposed approach significantly outperforms baseline and the state-of-the-art methods.