Preference and Concurrence Aware Bayesian Graph Neural Networks for Recommender Systems
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916102889537536 |
|---|---|
| author | Gu, Hongjian Hu, Yaochen Zhang, Yingxue |
| author_facet | Gu, Hongjian Hu, Yaochen Zhang, Yingxue |
| contents | Graph-based collaborative filtering methods have prevailing performance for recommender systems since they can capture high-order information between users and items, in which the graphs are constructed from the observed user-item interactions that might miss links or contain spurious positive interactions in industrial scenarios. The Bayesian Graph Neural Network framework approaches this issue with generative models for the interaction graphs. The critical problem is to devise a proper family of graph generative models tailored to recommender systems. We propose an efficient generative model that jointly considers the preferences of users, the concurrence of items and some important graph structure information. Experiments on four popular benchmark datasets demonstrate the effectiveness of our proposed graph generative methods for recommender systems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_11486 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Preference and Concurrence Aware Bayesian Graph Neural Networks for Recommender Systems Gu, Hongjian Hu, Yaochen Zhang, Yingxue Information Retrieval Machine Learning Graph-based collaborative filtering methods have prevailing performance for recommender systems since they can capture high-order information between users and items, in which the graphs are constructed from the observed user-item interactions that might miss links or contain spurious positive interactions in industrial scenarios. The Bayesian Graph Neural Network framework approaches this issue with generative models for the interaction graphs. The critical problem is to devise a proper family of graph generative models tailored to recommender systems. We propose an efficient generative model that jointly considers the preferences of users, the concurrence of items and some important graph structure information. Experiments on four popular benchmark datasets demonstrate the effectiveness of our proposed graph generative methods for recommender systems. |
| title | Preference and Concurrence Aware Bayesian Graph Neural Networks for Recommender Systems |
| topic | Information Retrieval Machine Learning |
| url | https://arxiv.org/abs/2312.11486 |