Hyperbolic Graph Learning for Social Recommendation

被引:4
|
作者
Yang, Yonghui [1 ]
Wu, Le [1 ]
Zhang, Kun [1 ]
Hong, Richang [1 ]
Zhou, Hailin [2 ]
Zhang, Zhiqiang [3 ]
Zhou, Jun [3 ]
Wang, Meng [1 ]
机构
[1] Hefei Univ Technol, Sch Comp & Informat, Hefei 230009, Peoples R China
[2] IVY MOBIL, Shenzhen 518055, Peoples R China
[3] Ant Grp, Hangzhou 310058, Peoples R China
基金
中国国家自然科学基金;
关键词
Social networking (online); Data models; Geometry; Feature extraction; Convolution; Computational modeling; Manifolds; Hyperbolic graph learning; recommender systems; social recommendation; OPINION DYNAMICS; EVOLUTION; NETWORKS;
D O I
10.1109/TKDE.2023.3343402
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Social recommendation provides an auxiliary social network structure to enhance recommendation performances. By formulating user-user social network and user-item interaction graph, modern social recommendation architecture is built on learning user and item embeddings into Euclidean space with graph convolution operations. However, the Euclidean space suffers structure distortion when representing the nature power-law distribution of graphs, leading to sub-optimal results for graph based social recommendation. Recently, some studies have explored the alternative of graph embedding learning into hyperbolic space, which can preserve the hierarchy of real-world graphs. However, directly applying current hyperbolic graph embedding models for social recommendation is non-trivial as two challenges: network heterogeneity and social diffusion noise. First, due to the semantic gap existing between social networks and user-item interactions, how to tackle the heterogeneity issue of social recommendation under hyperbolic formulation? Second, explicit modeling of social diffusion easily introduces noise for user preference learning, especially for those active users with amounts of interactions. To tackle the above challenges, in this paper, we propose a Hyperbolic Graph Learning based Social Recommendation (HGSR) model. First, we exploit social structure with hyperbolic social embedding pre-training, which could preserve the hierarchical properties of social networks. Second, we construct the heterogeneous graph based on user-item interactions and social networks, then treat the pre-trained social embeddings as an additional feature input for user preference learning. Such that, we combine explicit heterogeneous graph learning and implicit feature enhancement for the hyperbolic social recommendation, which can well tackle heterogeneity and social noise issues. We conduct empirical studies on four datasets, and extensive experiments demonstrate the effectiveness of our proposed model compared to state-of-the-art baselines.
引用
收藏
页码:8488 / 8501
页数:14
相关论文
共 50 条
  • [1] Dual Variational Graph Reconstruction Learning for Social Recommendation
    Zhang, Yi
    Zhang, Yiwen
    Zhao, Yuchuan
    Deng, Shuiguang
    Yang, Yun
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (11) : 6002 - 6015
  • [2] Light disentangled graph learning for social recommendation
    Li, Yangding
    Feng, Hao
    Zeng, Yangyang
    Zhao, Xiangchao
    Chai, Jiawei
    Fu, Shaobin
    Ye, Cui
    Zhang, Shichao
    WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2025, 28 (03):
  • [3] Hyperbolic multichannel graph convolutional network for social recommendation
    Yang X.
    Chang M.
    Yu J.
    Wang D.
    Dang Z.
    Journal of Intelligent and Fuzzy Systems, 2024, 46 (04) : 9543 - 9557
  • [4] Hyperbolic Graph Attention Network
    Zhang, Yiding
    Wang, Xiao
    Shi, Chuan
    Jiang, Xunqiang
    Ye, Yanfang Fanny
    IEEE TRANSACTIONS ON BIG DATA, 2022, 8 (06) : 1690 - 1701
  • [5] Learning Social Graph for Inactive User Recommendation
    Liu, Nian
    Fan, Shen
    Bai, Ting
    Wang, Peng
    Sun, Mingwei
    Mo, Yanhu
    Xu, Xiaoxiao
    Liu, Hong
    Shi, Chuan
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PT VI, DASFAA 2024, 2024, 14855 : 151 - 167
  • [6] Enhancing Social Recommendation With Adversarial Graph Convolutional Networks
    Yu, Junliang
    Yin, Hongzhi
    Li, Jundong
    Gao, Min
    Huang, Zi
    Cui, Lizhen
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2022, 34 (08) : 3727 - 3739
  • [7] SSGCL: Simple Social Recommendation with Graph Contrastive Learning
    Duan, Zhihua
    Wang, Chun
    Zhong, Wending
    MATHEMATICS, 2024, 12 (07)
  • [8] Temporal Social Graph Network Hashing for Efficient Recommendation
    Xu, Yang
    Zhu, Lei
    Li, Jingjing
    Li, Fengling
    Shen, Heng Tao
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (07) : 3541 - 3555
  • [9] Graph Neural Networks for Social Recommendation
    Fan, Wenqi
    Ma, Yao
    Li, Qing
    He, Yuan
    Zhao, Eric
    Tang, Jiliang
    Yin, Dawei
    WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, : 417 - 426
  • [10] Contrastive Learning Based Graph Convolution Network for Social Recommendation
    Zhuang, Jiabo
    Meng, Shunmei
    Zhang, Jing
    Sheng, Victor S.
    ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2023, 17 (08)