Deep pairwise learning for user preferences via dual graph attention model in location-based social networks

被引:7
作者
Gong, Weihua [1 ]
Zheng, Kechen [1 ]
Zhang, Shubin [1 ]
Hu, Ping [1 ]
机构
[1] Zhejiang Univ Technol, Sch Comp Sci & Technol, Hangzhou 310023, Peoples R China
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Graph neural network; Location based social networks; Dual graph attentions; User preferences; RECOMMENDATION;
D O I
10.1016/j.eswa.2023.120222
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The rapid growth of location-based social networks (LBSN) has generated massive multi-mode entities such as users, locations and social topics, as well as multi-relationships among them. Learning deep user preferences over point of interests (POIs) and social topics in LBSN has attracted more and more attentions. However, most of the previous studies have failed to incorporate the severely sparse and multi-relational data of heterogeneous LBSN, which plays a vital role to enhance the prediction performance. Toward this challenge, in this paper, we propose a unified pairwise relationship prediction framework based on graph neural networks combined with dual attention mechanism model, dubbed GE2AT, which has fully considered to incorporate three types of user behavioral relations to better capture user preference over different entities. Specifically, we first model LBSN as one user social graph only including social relations, and other two bipartite graphs involved user-location checkin relations and user-social topics following relations respectively. Then, we propose dual graph attention networks to jointly learn deep latent representations of different entities by aggregating features from neighbors with different importance weights. After that, we adopt two multi-layer perceptron (MLP) to output the pairwise preferences of users over POIs and social topics. In addition, to alleviate data sparsity problem, on the basis of MLPs output results, we further leverage social relationships as social-aware influence for similar user preferences so as to enhance the pairwise prediction performance. Extensive experiments on two real-world datasets have demonstrated that our proposed framework GE2AT significantly outperform the state-of-the-art baselines on both prediction tasks for user preferences on POIs and social topics.
引用
收藏
页数:11
相关论文
共 46 条
[11]   Neural Collaborative Filtering [J].
He, Xiangnan ;
Liao, Lizi ;
Zhang, Hanwang ;
Nie, Liqiang ;
Hu, Xia ;
Chua, Tat-Seng .
PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'17), 2017, :173-182
[12]   An Attention-Based Spatiotemporal LSTM Network for Next POI Recommendation [J].
Huang, Liwei ;
Ma, Yutao ;
Wang, Shibo ;
Liu, Yanbo .
IEEE TRANSACTIONS ON SERVICES COMPUTING, 2021, 14 (06) :1585-1597
[13]   Time-sensitive POI Recommendation by Tensor Completion with Side Information [J].
Hui, Bo ;
Yan, Da ;
Chen, Haiquan ;
Ku, Wei-Shinn .
2022 IEEE 38TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2022), 2022, :205-217
[14]  
Kingma D. P., 3 INT C LEARNING REP, P1
[15]   Knowledge graph enhanced neural collaborative recommendation [J].
Sang L. ;
Xu M. ;
Qian S. ;
Wu X. .
Expert Systems with Applications, 2021, 164
[16]   Rank-GeoFM:A Ranking based Geographical Factorization Method for Point of Interest Recommendation [J].
Li, Xutao ;
Cong, Gao ;
Li, Xiao-Li ;
Tuan-Anh Nguyen Pham ;
Krishnaswamy, Shonali .
SIGIR 2015: PROCEEDINGS OF THE 38TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2015, :433-442
[17]   GeoMF: Joint Geographical Modeling and Matrix Factorization for Point-of-Interest Recommendation [J].
Lian, Defu ;
Zhao, Cong ;
Xie, Xing ;
Sun, Guangzhong ;
Chen, Enhong ;
Rui, Yong .
PROCEEDINGS OF THE 20TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING (KDD'14), 2014, :831-840
[18]  
Liao DL, 2018, PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P3435
[19]  
Liu Q, 2016, AAAI CONF ARTIF INTE, P194
[20]  
Liu YH, 2019, Arxiv, DOI arXiv:1911.07429