mlsanityData to 7 Oct 2026

DisenPOI: Disentangling Sequential and Geographical Influence for Point-of-Interest Recommendation

arXiv 2210.16591 ↗First posted 29 Oct 2022cs.IR cs.AIcited by 9

Not on the map. Why?

Abstract (arXiv)

Point-of-Interest (POI) recommendation plays a vital role in various location-aware services. It has been observed that POI recommendation is driven by both sequential and geographical influences. However, since there is no annotated label of the dominant influence during recommendation, existing methods tend to entangle these two influences, which may lead to sub-optimal recommendation performance and poor interpretability. In this paper, we address the above challenge by proposing DisenPOI, a novel Disentangled dual-graph framework for POI recommendation, which jointly utilizes sequential and geographical relationships on two separate graphs and disentangles the two influences with self-supervision. The key novelty of our model compared with existing approaches is to extract disentangled representations of both sequential and geographical influences with contrastive learning. To be specific, we construct a geographical graph and a sequential graph based on the check-in sequence of a user. We tailor their propagation schemes to become sequence-/geo-aware to better capture the corresponding influences. Preference proxies are extracted from check-in sequence as pseudo labels for the two influences, which supervise the disentanglement via a contrastive loss. Extensive experiments on three datasets demonstrate the superiority of the proposed model.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 19 of its 45 references that are in the map. First posted on arXiv 29 Oct 2022.

Builds on

19 of 45 references.

References · 19

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  2. 2017Graph Attention Networkscited by 8,854
  3. 2017Inductive Representation Learning on Large Graphscited by 6,284
  4. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  5. 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 875
  6. 2015Gated Graph Sequence Neural Networkscited by 792
  7. 2019Neural Graph Collaborative Filteringcited by 660
  8. 2017Deep Interest Network for Click-Through Rate Predictioncited by 541
  9. 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 336
  10. 2018Session-based Recommendation with Graph Neural Networkscited by 312
  11. 2020Disentangled Graph Collaborative Filteringcited by 118
  12. 2019Learning Disentangled Representations for Recommendationcited by 110
7 more
  1. 2021Learning Intents behind Interactions with Knowledge Graph for Recommendationcited by 94
  2. 2021DisenHAN: Disentangled Heterogeneous Graph Attention Network for Recommendationcited by 28
  3. 2022Disentangling Long and Short-Term Interests for Recommendationcited by 22
  4. 2021Reinforced Imitative Graph Representation Learning for Mobile User Profiling: An Adversarial Training Perspectivecited by 21
  5. 2022KGNN: Harnessing Kernel-based Networks for Semi-supervised Graph Classificationcited by 18
  6. 2022Kernel-based Substructure Exploration for Next POI Recommendationcited by 8
  7. 2021Dynamic Sequential Graph Learning for Click-Through Rate Predictioncited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 2; 2025: 4; 2026: 1.

9 papers.