Skip to content
Book Open access

Is the Last Check-In All You Need? Next POI Recommendation: Recall and Rerank

Aug 2026 · Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2 · 0 citations · 29 references

TL;DR

K1-POI is proposed, a concise recall-and-rerank framework that formulates sparse next-POI prediction as candidate generation and calibration and an efficient Spatio-Temporal Prior Reranker (ST-Reranker) that calibrates the ordering within the top-K candidates using additive, model-agnostic spatio-temporal priors computed from the training split.

Abstract

Next Point-of-Interest (POI) recommendation aims to predict the next POI a user will visit based on the historical check-ins, but widely used datasets suffer from severe sparsity, making long-range transition modeling difficult to learn reliably. In this work, we revisit next-POI prediction from a minimalist perspective and point out an extreme short-horizon dominance in these datasets: the most predictive signal often collapses to the last check-in, while higher-order transition patterns quickly become too sparse to exploit. Based on this, we propose K1-POI, a concise recall-and-rerank framework that formulates sparse next-POI prediction as candidate generation and calibration. In the recall stage, we design a window-input self-attention backbone that uses only the most recent check-in (k=1) to retrieve a high-quality top-K candidate set; we further introduce a lightweight contrastive objective to align the backbone representation with the embedding of the ground-truth next POI within the candidate set. In the rerank stage, we propose an efficient Spatio-Temporal Prior Reranker (ST-Reranker) that calibrates the ordering within the top-K candidates using additive, model-agnostic spatio-temporal priors computed from the training split. Experiments on three public datasets show that K1-POI achieves strong performance across all datasets. Beyond performance, we propose a set of simple statistics-based ''guess'' baselines and conduct extensive analyses, showing that benchmark performance is largely explained by user preference, one-step transition routines, and spatio-temporal habits. These findings suggest that mining long-range check-in transition patterns may be a particularly challenging direction under current sparse benchmark settings.

Read PDF

Similar papers

Book Open access Sep 2026

Safety-Aware Next-POI Recommendation with Large Language Models

A safety-aware next-POI recommendation method that leverages a Large Language Model (LLM) to generate predictions informed by both mobility patterns and crime-derived safety signals that substantially improves the safety profile of recommended POIs and surpasses state-of-the-art baselines in overall accuracy.

Rami Zaboura, Ludovico Boratto, Adir Solomon · 0 citations
Preprint Sep 2026

Closing the Long-Short View Gap in Sequential Recommendation without Cached History

This paper empirically identifies two structural flaws rooted in geometric properties and dataset sparsity, and proposes a novel two-stage framework to close the long-short-view performance gap and introduces a modified softmax to counter prefix position bias.

Ling-Feng Shi, Chengkai Huang, Li-Na Yao et al. · 0 citations
Open access Aug 2026

Exposure-Aware Gated Refinement for Balancing Accuracy and Coverage in Closed-Loop Sequential Recommendation

Sequential recommendation aims to predict the next item from a user’s past interaction sequence, and has largely advanced around how accurately the ground-truth item is ranked. In practice, however, a recommendation list influences subsequent user behavior and item exposure, forming a closed-loop feedback process. As t...

Yu-Jin Ju, Jaedong Lee, Sohyun Park · 0 citations
Book Open access Sep 2026

TRACE: Targeted Ranking-Aware Counterfactual Explanation for Sequential Recommendation

TRACE (Targeted Ranking-Aware Counterfactual Explanation), which decomposes the search into three stages under an embedding-accessible, training-free setting: influence-guided position selection, plausibility-aware candidate retrieval, and actual-margin beam pruning.

Ungsik Kim, Sang-Min Choi, Gun-Woo Kim et al. · 1 citation
#artificial intelligence Preprint Aug 2026

An Empirical Evaluation of Cross-City POI Recommendation on a Large-Scale Benchmark

The need for task-specific designs that support cross-city preference transfer, semantic grounding, and scalable reasoning over unseen destination inventories is highlighted, with results highlighting the need for task-specific designs that support cross-city preference transfer, semantic grounding, and scalable reason...

Pei-Bo Li, Yang Song, Hao Xue et al. · 0 citations
Book Open access Aug 2026

G²PRO: Gradient-guided Graph Prompt Optimization for LLM-based POI Recommendation

Large Language Models (LLMs) have shown strong potential for sequential reasoning, creating new opportunities for next Point-of-Interest (POI) recommendation. However, applying LLMs to POI prediction remains challenging due to the modality gap between textual semantics and continuous spatio-temporal signals. Existing r...

Nan Jiang, Haitao Yuan, Tian-Jun Wei et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.