Bi-Level Graph Structure Learning for Next POI Recommendation
Liang Wang, Shu Wu, Qiang Liu, Yanqiao Zhu, Xiang Tao, Mengdi Zhang,, Liang Wang

TL;DR
This paper introduces a bi-level graph structure learning approach for next POI recommendation, capturing hierarchical relationships and improving robustness against data noise, leading to better accuracy and exploration.
Contribution
The paper proposes a novel bi-level graph learning framework that models hierarchical POI relationships and enhances recommendation robustness and accuracy.
Findings
Outperforms state-of-the-art methods on three datasets
Improves recommendation accuracy and exploration
Robust to data noise and sparsity
Abstract
Next point-of-interest (POI) recommendation aims to predict a user's next destination based on sequential check-in history and a set of POI candidates. Graph neural networks (GNNs) have demonstrated a remarkable capability in this endeavor by exploiting the extensive global collaborative signals present among POIs. However, most of the existing graph-based approaches construct graph structures based on pre-defined heuristics, failing to consider inherent hierarchical structures of POI features such as geographical locations and visiting peaks, or suffering from noisy and incomplete structures in graphs. To address the aforementioned issues, this paper presents a novel Bi-level Graph Structure Learning (BiGSL) for next POI recommendation. BiGSL first learns a hierarchical graph structure to capture the fine-to-coarse connectivity between POIs and prototypes, and then uses a pairwise…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsSparse Evolutionary Training
