Papers
Topics
Authors
Recent
Search
2000 character limit reached

Modeling Spatiotemporal Periodicity and Collaborative Signal for Local-Life Service Recommendation

Published 22 Sep 2023 in cs.IR | (2309.12565v1)

Abstract: Online local-life service platforms provide services like nearby daily essentials and food delivery for hundreds of millions of users. Different from other types of recommender systems, local-life service recommendation has the following characteristics: (1) spatiotemporal periodicity, which means a user's preferences for items vary from different locations at different times. (2) spatiotemporal collaborative signal, which indicates similar users have similar preferences at specific locations and times. However, most existing methods either focus on merely the spatiotemporal contexts in sequences, or model the user-item interactions without spatiotemporal contexts in graphs. To address this issue, we design a new method named SPCS in this paper. Specifically, we propose a novel spatiotemporal graph transformer (SGT) layer, which explicitly encodes relative spatiotemporal contexts, and aggregates the information from multi-hop neighbors to unify spatiotemporal periodicity and collaborative signal. With extensive experiments on both public and industrial datasets, this paper validates the state-of-the-art performance of SPCS.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (28)
  1. CPDG: A Contrastive Pre-Training Method for Dynamic Graph Neural Networks. arXiv preprint arXiv:2307.02813 (2023).
  2. Long Short-Term Preference Modeling for Continuous-Time Sequential Recommendation. arXiv preprint arXiv:2208.00593 (2022).
  3. ST-PIL: Spatial-Temporal Periodic Interest Learning for Next Point-of-Interest Recommendation. In CIKM. 2960–2964.
  4. Continuous-Time Sequential Recommendation with Temporal Graph Collaborative Transformer. In CIKM. 433–442.
  5. STGCN: A Spatial-Temporal Aware Graph Learning Method for POI Recommendation. In ICDM. 1052–1057.
  6. Lightgcn: Simplifying and Powering Graph Convolution Network for Recommendation. In SIGIR. 639–648.
  7. Time Interval Aware Self-Attention for Sequential Recommendation. In WSDM. 322–330.
  8. Geography-aware sequential location recommendation. In KDD. 2009–2019.
  9. Predicting the next location: A recurrent model with spatial and temporal contexts. In AAAI.
  10. Exploiting geographical neighborhood characteristics for location recommendation. In CIKM. 739–748.
  11. Lynn H Loomis. 2013. Introduction to abstract harmonic analysis.
  12. Stan: Spatio-temporal attention network for next location recommendation. In WWW. 2177–2185.
  13. Point-of-interest recommendation: Exploiting self-attentive autoencoders with neighbor-aware influence. In CIKM. 697–706.
  14. Larry R Medsker and LC Jain. 2001. Recurrent neural networks. Design and Applications 5 (2001), 64–67.
  15. Pytorch: An imperative style, high-performance deep learning library. NIPS 32 (2019).
  16. BPR: Bayesian Personalized Ranking from Implicit Feedback. In UAI. 452–461.
  17. C Carl Robusto. 1957. The cosine-haversine formula. The American Mathematical Monthly 64, 1 (1957), 38–40.
  18. Temporal Graph Networks for Deep Learning on Dynamic Graphs. ICML’Workshop (2020).
  19. Where to go next: Modeling long-and short-term user preferences for point-of-interest recommendation. In AAAI, Vol. 34. 214–221.
  20. Temporal Contrastive Pre-Training for Sequential Recommendation. In CIKM. 1925–1934.
  21. Attention is all you need. NIPS 30 (2017).
  22. Modeling item-specific temporal dynamics of repeat consumption for recommender systems. In WWW. 1977–1987.
  23. Neural Graph Collaborative Filtering. SIGIR (2019), 165–174. arXiv:1905.08108
  24. Session-Based Recommendation with Graph Neural Networks. AAAI 33 (2019), 346–353. arXiv:1811.00855
  25. Inductive Representation Learning on Temporal Graphs. In ICLR.
  26. GETNext: trajectory flow map enhanced transformer for next POI recommendation. In SIGIR. 1144–1153.
  27. Deep Interest Evolution Network for Click-Through Rate Prediction. AAAI 33 (2019), 5941–5948.
  28. Deep interest network for click-through rate prediction. In KDD. 1059–1068.
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.