Introduction
Predicting a user's next Point-of-Interest (POI) is fundamental to modern location-based services, from personalized trip planning to targeted advertising. However, traditional models struggle with three primary challenges: extreme data sparsity, the static nature of POI relationship graphs, and "information oblivion," where long-range dependencies in user trajectories are lost over time.
To address these, the Sequence-based Neighbour search and Prediction Model (SNPM) is proposed. SNPM leverages a dynamic neighbor graph to handle sparsity and context, alongside a multi-step recurrent neural network that explicitly models long-term dependencies using geometric rotation operations.
The SNPM Architecture
The SNPM framework integrates two innovative components: a Sequence-based Dynamic Neighbor Graph (SDNG) and a Multi-Step Dependency Prediction (MSDP) module. The overall architecture, as shown in Figure 1, coordinates these elements to transform raw historical trajectories into accurate next-location predictions.
Sequence-based Dynamic Neighbor Graph (SDNG)
Unlike static graphs that assume fixed relationships between locations, the SDNG component builds a context-aware graph. It utilizes RotatE knowledge graph embeddings to infer potential transitions in sparse data and clusters POIs into regions. Crucially, it dynamically selects relevant neighbors based on the user's current visited sequence, ensuring that the aggregated information is contextually pertinent to the immediate trajectory.
Multi-Step Dependency Prediction (MSDP)
The core of the prediction module is the Multi-Step Recurrent Neural Network (MSRNN). To combat the vanishing memory of standard RNNs, MSRNN explicitly "looks back" at the last $K$ visited POIs. It employs a rotation operation in complex space (inspired by RotatE) to model the influence of each historical step. This geometric approach provides a more robust and structured representation of long-term patterns compared to traditional gating mechanisms.
Experimental Evaluation
The model was rigorously tested on the Gowalla and Foursquare datasets, which contain millions of check-ins. SNPM demonstrated superior performance, outperforming state-of-the-art baselines like GETNext and Flashback. Specifically, it achieved accuracy gains (Acc@1) of 12.26% on Gowalla and 9.56% on Foursquare.
Beyond raw accuracy, SNPM exhibits significant robustness. As illustrated in Figure 4, the model's performance remains stable across a wide range of hyperparameter settings, including the neighbor search window ($\omega$) and the look-back window ($K$). This stability suggests that the model effectively captures underlying behavioral patterns rather than over-fitting to specific configurations.
Conclusion
SNPM represents a significant advancement in next POI recommendation by moving beyond static graph structures and implicit sequential modeling. By combining dynamic, context-aware neighbor aggregation with explicit, rotation-based multi-step dependencies, the framework effectively mitigates the issues of data sparsity and information loss. Future work will focus on deeper personalization and optimizing the computational efficiency of the dynamic search process.
Summary updated