Self-supervised Graph-based Point-of-interest Recommendation
- URL: http://arxiv.org/abs/2210.12506v1
- Date: Sat, 22 Oct 2022 17:29:34 GMT
- Title: Self-supervised Graph-based Point-of-interest Recommendation
- Authors: Yang Li, Tong Chen, Peng-Fei Zhang, Zi Huang, Hongzhi Yin
- Abstract summary: Next Point-of-Interest (POI) recommendation has become a prominent component in location-based e-commerce.
We propose a Self-supervised Graph-enhanced POI Recommender (S2GRec) for next POI recommendation.
In particular, we devise a novel Graph-enhanced Self-attentive layer to incorporate the collaborative signals from both global transition graph and local trajectory graphs.
- Score: 66.58064122520747
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The exponential growth of Location-based Social Networks (LBSNs) has greatly
stimulated the demand for precise location-based recommendation services. Next
Point-of-Interest (POI) recommendation, which aims to provide personalised POI
suggestions for users based on their visiting histories, has become a prominent
component in location-based e-commerce. Recent POI recommenders mainly employ
self-attention mechanism or graph neural networks to model complex high-order
POI-wise interactions. However, most of them are merely trained on the
historical check-in data in a standard supervised learning manner, which fail
to fully explore each user's multi-faceted preferences, and suffer from data
scarcity and long-tailed POI distribution, resulting in sub-optimal
performance. To this end, we propose a Self-s}upervised Graph-enhanced POI
Recommender (S2GRec) for next POI recommendation. In particular, we devise a
novel Graph-enhanced Self-attentive layer to incorporate the collaborative
signals from both global transition graph and local trajectory graphs to
uncover the transitional dependencies among POIs and capture a user's temporal
interests. In order to counteract the scarcity and incompleteness of POI
check-ins, we propose a novel self-supervised learning paradigm in \ssgrec,
where the trajectory representations are contrastively learned from two
augmented views on geolocations and temporal transitions. Extensive experiments
are conducted on three real-world LBSN datasets, demonstrating the
effectiveness of our model against state-of-the-art methods.
Related papers
- Bi-Level Graph Structure Learning for Next POI Recommendation [28.44264733067864]
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.
This paper presents a novel Bi-level Graph Structure Learning (BiGSL) for next POI recommendation.
arXiv Detail & Related papers (2024-11-02T07:40:16Z) - APGL4SR: A Generic Framework with Adaptive and Personalized Global
Collaborative Information in Sequential Recommendation [86.29366168836141]
We propose a graph-driven framework, named Adaptive and Personalized Graph Learning for Sequential Recommendation (APGL4SR)
APGL4SR incorporates adaptive and personalized global collaborative information into sequential recommendation systems.
As a generic framework, APGL4SR can outperform other baselines with significant margins.
arXiv Detail & Related papers (2023-11-06T01:33:24Z) - Bayes-enhanced Multi-view Attention Networks for Robust POI
Recommendation [81.4999547454189]
Existing works assume the available POI check-ins reported by users are the ground-truth depiction of user behaviors.
In real application scenarios, the check-in data can be rather unreliable due to both subjective and objective causes.
We propose a Bayes-enhanced Multi-view Attention Network to address the uncertainty factors of the user check-ins.
arXiv Detail & Related papers (2023-11-01T12:47:38Z) - Graph Neural Bandits [49.85090929163639]
We propose a framework named Graph Neural Bandits (GNB) to leverage the collaborative nature among users empowered by graph neural networks (GNNs)
To refine the recommendation strategy, we utilize separate GNN-based models on estimated user graphs for exploitation and adaptive exploration.
arXiv Detail & Related papers (2023-08-21T15:57:57Z) - Ordinal Graph Gamma Belief Network for Social Recommender Systems [54.9487910312535]
We develop a hierarchical Bayesian model termed ordinal graph factor analysis (OGFA), which jointly models user-item and user-user interactions.
OGFA not only achieves good recommendation performance, but also extracts interpretable latent factors corresponding to representative user preferences.
We extend OGFA to ordinal graph gamma belief network, which is a multi-stochastic-layer deep probabilistic model.
arXiv Detail & Related papers (2022-09-12T09:19:22Z) - Exploiting Bi-directional Global Transition Patterns and Personal
Preferences for Missing POI Category Identification [37.025295828186955]
We propose a novel neural network approach to identify the missing POI categories.
Specifically, we design an attention matching cell to model how well the check-in category information matches their non-personal transition patterns and personal preferences.
Our model can be naturally extended to address next POI category recommendation and prediction tasks with competitive performance.
arXiv Detail & Related papers (2021-12-31T04:15:37Z) - Modelling of Bi-directional Spatio-Temporal Dependence and Users'
Dynamic Preferences for Missing POI Check-in Identification [38.51964956686177]
We develop a model, named Bi-STDDP, which can integrate bi-directional-temporal dependence and users' dynamic preferences.
Results demonstrate significant improvements of our model compared with state-of-the-art methods.
arXiv Detail & Related papers (2021-12-31T03:54:37Z) - Self-supervised Graph Learning for Recommendation [69.98671289138694]
We explore self-supervised learning on user-item graph for recommendation.
An auxiliary self-supervised task reinforces node representation learning via self-discrimination.
Empirical studies on three benchmark datasets demonstrate the effectiveness of SGL.
arXiv Detail & Related papers (2020-10-21T06:35:26Z) - STP-UDGAT: Spatial-Temporal-Preference User Dimensional Graph Attention
Network for Next POI Recommendation [22.705788963791445]
Next Point-of-Interest (POI) recommendation is a longstanding problem across the domains of Location-Based Social Networks (LBSN) and transportation.
Recent Recurrent Neural Network (RNN) based approaches learn POI-POI relationships in a local view based on independent user visit sequences.
We propose a novel explore-exploit model that concurrently exploits personalized user preferences and explores new POIs in global spatial-temporal-preference neighbourhoods.
arXiv Detail & Related papers (2020-10-06T04:03:42Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.