Ordinal Graph Gamma Belief Network for Social Recommender Systems
- URL: http://arxiv.org/abs/2209.05106v1
- Date: Mon, 12 Sep 2022 09:19:22 GMT
- Title: Ordinal Graph Gamma Belief Network for Social Recommender Systems
- Authors: Dongsheng Wang, Chaojie Wang, Bo Chen, Mingyuan Zhou
- Abstract summary: We develop a hierarchical Bayesian model termed ordinal graph factor analysis (OGFA), which jointly models user-item and user-user interactions.
OGFA not only achieves good recommendation performance, but also extracts interpretable latent factors corresponding to representative user preferences.
We extend OGFA to ordinal graph gamma belief network, which is a multi-stochastic-layer deep probabilistic model.
- Score: 54.9487910312535
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: To build recommender systems that not only consider user-item interactions
represented as ordinal variables, but also exploit the social network
describing the relationships between the users, we develop a hierarchical
Bayesian model termed ordinal graph factor analysis (OGFA), which jointly
models user-item and user-user interactions. OGFA not only achieves good
recommendation performance, but also extracts interpretable latent factors
corresponding to representative user preferences. We further extend OGFA to
ordinal graph gamma belief network, which is a multi-stochastic-layer deep
probabilistic model that captures the user preferences and social communities
at multiple semantic levels. For efficient inference, we develop a parallel
hybrid Gibbs-EM algorithm, which exploits the sparsity of the graphs and is
scalable to large datasets. Our experimental results show that the proposed
models not only outperform recent baselines on recommendation datasets with
explicit or implicit feedback, but also provide interpretable latent
representations.
Related papers
- Linear-Time Graph Neural Networks for Scalable Recommendations [50.45612795600707]
The key of recommender systems is to forecast users' future behaviors based on previous user-item interactions.
Recent years have witnessed a rising interest in leveraging Graph Neural Networks (GNNs) to boost the prediction performance of recommender systems.
We propose a Linear-Time Graph Neural Network (LTGNN) to scale up GNN-based recommender systems to achieve comparable scalability as classic MF approaches.
arXiv Detail & Related papers (2024-02-21T17:58:10Z) - Preference and Concurrence Aware Bayesian Graph Neural Networks for
Recommender Systems [5.465420718331109]
Graph-based collaborative filtering methods have prevailing performance for 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.
arXiv Detail & Related papers (2023-11-30T11:49:33Z) - Neural Graph Collaborative Filtering Using Variational Inference [19.80976833118502]
We introduce variational embedding collaborative filtering (GVECF) as a novel framework to incorporate representations learned through a variational graph auto-encoder.
Our proposed method achieves up to 13.78% improvement in the recall over the test data.
arXiv Detail & Related papers (2023-11-20T15:01:33Z) - APGL4SR: A Generic Framework with Adaptive and Personalized Global
Collaborative Information in Sequential Recommendation [86.29366168836141]
We propose a graph-driven framework, named Adaptive and Personalized Graph Learning for Sequential Recommendation (APGL4SR)
APGL4SR incorporates adaptive and personalized global collaborative information into sequential recommendation systems.
As a generic framework, APGL4SR can outperform other baselines with significant margins.
arXiv Detail & Related papers (2023-11-06T01:33:24Z) - Graph Neural Bandits [49.85090929163639]
We propose a framework named Graph Neural Bandits (GNB) to leverage the collaborative nature among users empowered by graph neural networks (GNNs)
To refine the recommendation strategy, we utilize separate GNN-based models on estimated user graphs for exploitation and adaptive exploration.
arXiv Detail & Related papers (2023-08-21T15:57:57Z) - Challenging the Myth of Graph Collaborative Filtering: a Reasoned and Reproducibility-driven Analysis [50.972595036856035]
We present a code that successfully replicates results from six popular and recent graph recommendation models.
We compare these graph models with traditional collaborative filtering models that historically performed well in offline evaluations.
By investigating the information flow from users' neighborhoods, we aim to identify which models are influenced by intrinsic features in the dataset structure.
arXiv Detail & Related papers (2023-08-01T09:31:44Z) - Self-Supervised Hypergraph Transformer for Recommender Systems [25.07482350586435]
Self-Supervised Hypergraph Transformer (SHT)
Self-Supervised Hypergraph Transformer (SHT)
Cross-view generative self-supervised learning component is proposed for data augmentation over the user-item interaction graph.
arXiv Detail & Related papers (2022-07-28T18:40:30Z) - A Graph-Enhanced Click Model for Web Search [67.27218481132185]
We propose a novel graph-enhanced click model (GraphCM) for web search.
We exploit both intra-session and inter-session information for the sparsity and cold-start problems.
arXiv Detail & Related papers (2022-06-17T08:32:43Z) - Multi-Behavior Enhanced Recommendation with Cross-Interaction
Collaborative Relation Modeling [42.6279077675585]
This work proposes a Graph Neural Multi-Behavior Enhanced Recommendation framework.
It explicitly models the dependencies between different types of user-item interactions under a graph-based message passing architecture.
Experiments on real-world recommendation datasets show that our GNMR consistently outperforms state-of-the-art methods.
arXiv Detail & Related papers (2022-01-07T03:12:37Z) - Hierarchical BiGraph Neural Network as Recommendation Systems [0.0]
We propose a hierarchical approach of using GNNs as recommendation systems and structuring the user-item features using a bigraph framework.
Our experimental results show competitive performance with current recommendation system methods and transferability.
arXiv Detail & Related papers (2020-07-27T18:01:41Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.