Journal Article10.1016/j.knosys.2022.109951
Building and exploiting spatial-temporal knowledge graph for next POI recommendation
40
TL;DR: Chen et al. as discussed by the authors proposed a spatial-temporal KG (STKG) from check-in sequences of users to promote the next POI recommendation, without introducing any external attributes of users and POIs.
read more
Abstract: Next Point-of-Interest (POI) recommendation has shown great value for both users and businesses in the field of location-based services. Many spatial–temporal inferring methods have been developed to perform this task, but the data sparsity of POI trajectories greatly hinders the recommendation performance. Knowledge graphs (KGs) have been demonstrated as an effective way to tackle data sparsity in the general recommendation field by leveraging the valuable information of entities and relations. Yet, few studies have explored applying KGs for the next POI recommendation task because of the following challenges: (1) how to represent the dynamic mobility behaviors of users with the static entities and relations in KGs; and (2) how to utilize the different types of entities and relations in KGs to capture long- and short-term preferences of users. In this work, we investigate building a spatial–temporal KG (STKG) from check-in sequences of users to promote the next POI recommendation, without introducing any external attributes of users and POIs. In STKG, we design a novel spatial–temporal transfer relation to intuitively capture users’ transition patterns between neighboring POIs. Then, based on the STKG, we propose an innovative model, named STKGRec, for the next POI recommendation, which explicitly models long- and short-term preferences of users in an end-to-end manner. In particular, STKGRec learns both the spatial–temporal correlation of consecutive and nonconsecutive visits in the current check-in sequence to comprehensively capture the short-term preferences of users. Extensive experiments on four real-world datasets demonstrate the superiority of STKGRec against the state-of-the-art baseline methods. The code of our proposed model is available at https://github.com/WeiChen3690/STKGRec .
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Journal Article
Temporal Knowledge Graph Completion: A Survey
TL;DR: This paper summarizes existing TKGC methods based on how timestamps of facts are used to capture the temporal dynamics and presents future research directions of TK GC.
55
MINES: Message Intercommunication for Inductive Relation Reasoning over Neighbor-Enhanced Subgraphs
Kenny Ye Liang,Lingyuan Meng,Sihang Zhou,Wenxuan Tu,Siwei Wang,Yue Liu,Meng Liu,Long Zhao,Xiangjun Dong,Xinwang Liu +9 more
- 24 Mar 2024
TL;DR: MINES, a novel GraIL-based framework, addresses limitations in inductive relation reasoning by introducing a message intercommunication mechanism on neighbor-enhanced subgraphs, capturing hidden mutual information and enhancing information collection for knowledge graph reasoning tasks.
24
POI recommendation for occasional groups Based on hybrid graph neural networks
LingQiang Meng,Zhizhong Liu,Dianhui Chu,Qaun Z. Sheng,Jian Yu,Xiaoyu Song +5 more
TL;DR: This study proposes PROG-HGNN, a hybrid graph neural network model for POI recommendation in occasional groups, achieving 32.92% and 19.67% improvement in Precision@K and Recall@K over baseline models on three benchmark datasets.
10
ImNext: Irregular Interval Attention and Multi-Task Learning for Next POI Recommendation
Xi He,Weikang He,Yilin Liu,Xingyu Lu,Yunpeng Xiao,Yanbing Liu +5 more
TL;DR: This paper proposes ImNext, a next POI recommendation model that addresses data sparsity and irregular intervals in user check-in sequences using data augmentation and novel attention mechanisms, outperforming state-of-the-art methods on two real-world datasets.
3
Sampling-based Epoch Differentiation Calibrated Graph Convolution Network for Point-of-interest Recommendation
Fan Mo,Xin Fan,Chongxian Chen,Changhao Bai,Hayato Yamana +4 more
TL;DR: This study proposes a sampling-based epoch differentiation calibrated Graph Convolution Network (GCN) for point-of-interest (POI) recommendation, improving calibration and accuracy by merging calibration into the GCN training process, outperforming state-of-the-art baselines on Philadelphia and Tucson datasets.
3
References
Learning Phrase Representations using RNN Encoder--Decoder for Statistical Machine Translation
Kyunghyun Cho,Bart van Merriënboer,Caglar Gulcehre,Dzmitry Bahdanau,Fethi Bougares,Holger Schwenk,Yoshua Bengio,Yoshua Bengio,Yoshua Bengio +8 more
- 01 Jan 2014
TL;DR: In this paper, the encoder and decoder of the RNN Encoder-Decoder model are jointly trained to maximize the conditional probability of a target sequence given a source sequence.
•Posted Content
Empirical evaluation of gated recurrent neural networks on sequence modeling
TL;DR: These advanced recurrent units that implement a gating mechanism, such as a long short-term memory (LSTM) unit and a recently proposed gated recurrent unit (GRU), are found to be comparable to LSTM.
14.1K
•Proceedings Article
Proceedings of the 25th international conference on Machine learning
William W. Cohen,Andrew McCallum,Sam T. Roweis +2 more
- 05 Jul 2008
TL;DR: This volume contains the papers accepted to the 25th International Conference on Machine Learning (ICML 2008), the annual conference of the International Machine Learning Society, and provides a venue for the presentation and discussion of current research in the field of machine learning.
6.4K
•Proceedings Article
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
Balaji Krishnapuram,Mohak Shah,Alexander J. Smola,Charu C. Aggarwal,Dou Shen,Rajeev Rastogi +5 more
- 13 Aug 2016
TL;DR: The 2016 ACM Conference on Knowledge Discovery and Data Mining (KDD'16) as mentioned in this paper has attracted a significant number of submissions from countries all over the world, in particular, the research track attracted 784 submissions and the applied data science track attracted 331 submissions.
4.5K
•Proceedings Article
Knowledge graph embedding by translating on hyperplanes
Zhen Wang,Jianwen Zhang,Jianlin Feng,Zheng Chen +3 more
- 27 Jul 2014
TL;DR: This paper proposes TransH which models a relation as a hyperplane together with a translation operation on it and can well preserve the above mapping properties of relations with almost the same model complexity of TransE.