VIGA: A variational graph autoencoder model to infer user interest representations for recommendation

被引:14
作者
Gan, Mingxin [1 ]
Zhang, Hang [1 ]
机构
[1] Univ Sci & Technol Beijing, Sch Econ & Management, Beijing, Peoples R China
基金
中国国家自然科学基金;
关键词
Recommender system; Graph embedding; Autoencoder; Variational inference; Representation learning; User interest;
D O I
10.1016/j.ins.2023.119039
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Learning representations of both user interests and item characteristics is essentially important for recommendation tasks. Although graph neural network-based methods have significant advantages, there are still two inherent limitations: (i) users or items are often modeled as single embedding points in the vector space, and (ii) these methods usually focus more on the graph structure of user-item interactions, rather than the attribute-related information and useful attribute interactions. These limitations make it difficult to model complex user interests and learn high-quality representations, thus fail to obtain high recommendation accuracy. To overcome these limitations, we propose a variational inference-based graph autoencoder (VIGA) model to explore a multivariate distribution over latent representations for recommendation. In brief, to identify both of the complex users' interests and their interactive behaviors, VIGA first encodes users and items into latent variables, and subjects them to a multivariate Gaussian distribution via a graph autoencoder framework based on Bayesian variational inference. Then a feature fusion layer is established for the exchange and integration of both the topological structure and nodes attributes in the user-item interaction graph. Experiments on three real-world datasets show that the proposed VIGA method significantly outperforms state-of-the-art recommendation methods on recommendation accuracy.
引用
收藏
页数:19
相关论文
共 48 条
[1]  
[Anonymous], 2015, ACS SYM SER
[2]  
Berg R. V. D., 2018, KDD DEEP LEARNING DA
[3]   Meta-relation assisted knowledge-aware coupled graph neural network for recommendation [J].
Chang, Yao ;
Zhou, Wei ;
Cai, Haini ;
Fan, Wei ;
Hu, Linfeng ;
Wen, Junhao .
INFORMATION PROCESSING & MANAGEMENT, 2023, 60 (03)
[4]   Cell type annotation of single-cell chromatin accessibility data via supervised Bayesian embedding [J].
Chen, Xiaoyang ;
Chen, Shengquan ;
Song, Shuang ;
Gao, Zijing ;
Hou, Lin ;
Zhang, Xuegong ;
Lv, Hairong ;
Jiang, Rui .
NATURE MACHINE INTELLIGENCE, 2022, 4 (02) :116-126
[5]   An improved matrix factorization based model for many-objective optimization recommendation [J].
Cui, Zhihua ;
Zhao, Peng ;
Hu, Zhaoming ;
Cai, Xingjuan ;
Zhang, Wensheng ;
Chen, Jinjun .
INFORMATION SCIENCES, 2021, 579 :1-14
[6]   Dual Preference Distribution Learning for Item Recommendation [J].
Dong, Xue ;
Song, Xuemeng ;
Zheng, Na ;
Wei, Yinwei ;
Zhao, Zhongzhou .
ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2023, 41 (03)
[7]   Mapping user interest into hyper-spherical space: A novel POI recommendation method [J].
Gan, Mingxin ;
Ma, Yingxue .
INFORMATION PROCESSING & MANAGEMENT, 2023, 60 (02)
[8]   A knowledge-enhanced contextual bandit approach for personalized recommendation in dynamic domains [J].
Gan, Mingxin ;
Kwon, O-Chol .
KNOWLEDGE-BASED SYSTEMS, 2022, 251
[9]   DeepInteract: Multi-view features interactive learning for sequential recommendation [J].
Gan, Mingxin ;
Ma, Yingxue .
EXPERT SYSTEMS WITH APPLICATIONS, 2022, 204
[10]  
Gao Chen, 2023, ACM Transactions on Recommender Systems, V1, P1, DOI DOI 10.1145/3568022