Network-based models for social recommender systems
- URL: http://arxiv.org/abs/2002.03700v1
- Date: Mon, 10 Feb 2020 13:06:22 GMT
- Title: Network-based models for social recommender systems
- Authors: Antonia Godoy-Lorite, Roger Guimera and Marta Sales-Pardo
- Abstract summary: In this chapter, we explore rigorous network-based models that outperform leading approaches for recommendation.
The accurate prediction of individual user preferences over items can be accomplished by different methodologies.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: With the overwhelming online products available in recent years, there is an
increasing need to filter and deliver relevant personalized advice for users.
Recommender systems solve this problem by modeling and predicting individual
preferences for a great variety of items such as movies, books or research
articles. In this chapter, we explore rigorous network-based models that
outperform leading approaches for recommendation. The network models we
consider are based on the explicit assumption that there are groups of
individuals and of items, and that the preferences of an individual for an item
are determined only by their group memberships. The accurate prediction of
individual user preferences over items can be accomplished by different
methodologies, such as Monte Carlo sampling or Expectation-Maximization
methods, the latter resulting in a scalable algorithm which is suitable for
large datasets.
Related papers
- Budgeted Online Model Selection and Fine-Tuning via Federated Learning [26.823435733330705]
Online model selection involves selecting a model from a set of candidate models 'on the fly' to perform prediction on a stream of data.
The choice of candidate models henceforth has a crucial impact on the performance.
The present paper proposes an online federated model selection framework where a group of learners (clients) interacts with a server with sufficient memory.
Using the proposed algorithm, clients and the server collaborate to fine-tune models to adapt them to a non-stationary environment.
arXiv Detail & Related papers (2024-01-19T04:02:49Z) - Ada-Retrieval: An Adaptive Multi-Round Retrieval Paradigm for Sequential
Recommendations [50.03560306423678]
We propose Ada-Retrieval, an adaptive multi-round retrieval paradigm for recommender systems.
Ada-Retrieval iteratively refines user representations to better capture potential candidates in the full item space.
arXiv Detail & Related papers (2024-01-12T15:26:40Z) - ClusterSeq: Enhancing Sequential Recommender Systems with Clustering
based Meta-Learning [3.168790535780547]
ClusterSeq is a Meta-Learning Clustering-Based Sequential Recommender System.
It exploits dynamic information in the user sequence to enhance item prediction accuracy, even in the absence of side information.
Our proposed approach achieves a substantial improvement of 16-39% in Mean Reciprocal Rank (MRR)
arXiv Detail & Related papers (2023-07-25T18:53:24Z) - Recommender Systems with Generative Retrieval [58.454606442670034]
We propose a novel generative retrieval approach, where the retrieval model autoregressively decodes the identifiers of the target candidates.
To that end, we create semantically meaningful of codewords to serve as a Semantic ID for each item.
We show that recommender systems trained with the proposed paradigm significantly outperform the current SOTA models on various datasets.
arXiv Detail & Related papers (2023-05-08T21:48:17Z) - Multidimensional Item Response Theory in the Style of Collaborative
Filtering [0.8057006406834467]
This paper presents a machine learning approach to multidimensional item response theory (MIRT)
Inspired by collaborative filtering, we define a general class of models that includes many MIRT models.
We discuss the use of penalized joint maximum likelihood (JML) to estimate individual models and cross-validation to select the best performing model.
arXiv Detail & Related papers (2023-01-03T00:56:27Z) - A Sequence-Aware Recommendation Method Based on Complex Networks [1.385805101975528]
We build a network model from data and then use it to predict the user's subsequent actions.
The proposed method is implemented and tested experimentally on a large dataset.
arXiv Detail & Related papers (2022-09-30T16:34:39Z) - Ordinal Graph Gamma Belief Network for Social Recommender Systems [54.9487910312535]
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.
arXiv Detail & Related papers (2022-09-12T09:19:22Z) - Utilizing Textual Reviews in Latent Factor Models for Recommender
Systems [1.7361353199214251]
We propose a recommender algorithm that combines a rating modelling technique with a topic modelling method based on textual reviews.
We evaluate the performance of the algorithm using Amazon.com datasets with different sizes, corresponding to 23 product categories.
arXiv Detail & Related papers (2021-11-16T15:07:51Z) - PURS: Personalized Unexpected Recommender System for Improving User
Satisfaction [76.98616102965023]
We describe a novel Personalized Unexpected Recommender System (PURS) model that incorporates unexpectedness into the recommendation process.
Extensive offline experiments on three real-world datasets illustrate that the proposed PURS model significantly outperforms the state-of-the-art baseline approaches.
arXiv Detail & Related papers (2021-06-05T01:33:21Z) - Overcoming Data Sparsity in Group Recommendation [52.00998276970403]
Group recommender systems should be able to accurately learn not only users' personal preferences but also preference aggregation strategy.
In this paper, we take Bipartite Graphding Model (BGEM), the self-attention mechanism and Graph Convolutional Networks (GCNs) as basic building blocks to learn group and user representations in a unified way.
arXiv Detail & Related papers (2020-10-02T07:11:19Z) - MetaSelector: Meta-Learning for Recommendation with User-Level Adaptive
Model Selection [110.87712780017819]
We propose a meta-learning framework to facilitate user-level adaptive model selection in recommender systems.
We conduct experiments on two public datasets and a real-world production dataset.
arXiv Detail & Related papers (2020-01-22T16:05:01Z)
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.