A top-k POI recommendation approach based on LBSN and multi-graph fusion

被引:14
|
作者
Fang, Jinfeng [1 ,2 ]
Meng, Xiangfu [1 ,2 ]
Qi, Xueyue [1 ]
机构
[1] Liaoning Tech Univ, Sch Elect & Informat Engn, Huludao 125105, Peoples R China
[2] Liaoning Tech Univ, Sch Geomat, Fuxin 123000, Peoples R China
关键词
POI recommendation; Location-based social network; User-POI interaction graph; User social graph; Spectral cluster; Graph neural network; MODEL;
D O I
10.1016/j.neucom.2022.10.048
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
POI(Point of Interest) recommendation is a basic and on-going issue in LBSN (Location-based Social Network) services. In this paper, a novel POI recommendation approach which is based on LBSN and multi-graph fusion is proposed. First, we take advantages of the graph neural network to construct user-POI interaction graph based on the rating data of users and construct user social graph based on the user social networks. First-order friends and high-order friends will be considered simultaneously in the user social graph. And then, we present a spectral cluster-based algorithm to gain the latent vector of the POI in location space. After this, the graph neural network is used to learn the information above. Lastly, we predict the score based on the aforementioned information and pick out the top-k POIs with the highest scores to form a recommendation list. Extensive experiments conducted on real datasets demonstrated that the method proposed in this paper can effectively generate the embedding vectors of users and POIs, and can achieve high recommendation accuracy as well.(c) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页码:219 / 230
页数:12
相关论文
共 50 条
  • [31] Top-k differential queries in graph databases
    Vasilyeva, Elena
    Thiele, Maik
    Bornhövd, Christof
    Lehner, Wolfgang
    [J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8716 : 112 - 115
  • [32] SMRGAT: A traditional Chinese herb recommendation model based on a multi-graph residual attention network and semantic knowledge fusion
    Yang, Xiaoyan
    Ding, Changsong
    [J]. JOURNAL OF ETHNOPHARMACOLOGY, 2023, 315
  • [33] Top-k Graph Summarization on Hierarchical DAGs
    Zhu, Xuliang
    Huang, Xin
    Choi, Byron
    Xu, Jianliang
    [J]. CIKM '20: PROCEEDINGS OF THE 29TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, 2020, : 1903 - 1912
  • [34] Diversified Top-k Graph Pattern Matching
    Fan, Wenfei
    Wang, Xin
    Wu, Yinghui
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2013, 6 (13): : 1510 - 1521
  • [35] DeepAltTrip: Top-K Alternative Itineraries for Trip Recommendation
    Rashid, Syed Md. Mukit
    Ali, Mohammed Eunus
    Cheema, Muhammad Aamir
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (09) : 9433 - 9447
  • [36] Neural Variational Collaborative Filtering for Top-K Recommendation
    Deng, Xiaoyi
    Zhuang, Fuzhen
    [J]. TRENDS AND APPLICATIONS IN KNOWLEDGE DISCOVERY AND DATA MINING: PAKDD 2019 WORKSHOPS, 2019, 11607 : 352 - 364
  • [37] TRecSo: Enhancing Top-k Recommendation With Social Information
    Park, Chanyoung
    Kim, Donghyun
    Oh, Jinoh
    Yu, Hwanjo
    [J]. PROCEEDINGS OF THE 25TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'16 COMPANION), 2016, : 89 - 90
  • [38] Answering Top-k Graph Similarity Queries in Graph Databases
    Zhu, Yuanyuan
    Qin, Lu
    Yu, Jeffrey Xu
    Cheng, Hong
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2020, 32 (08) : 1459 - 1474
  • [39] Classification, Ranking, and Top-K Stability of Recommendation Algorithms
    Adomavicius, Gediminas
    Zhang, Jingjing
    [J]. INFORMS JOURNAL ON COMPUTING, 2016, 28 (01) : 129 - 147
  • [40] Variational Autoencoders for Top-K Recommendation with Implicit Feedback
    Askari, Bahare
    Szlichta, Jaroslaw
    Salehi-Abari, Amirali
    [J]. SIGIR '21 - PROCEEDINGS OF THE 44TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2021, : 2061 - 2065