Modurec: Recommender Systems with Feature and Time Modulation
- URL: http://arxiv.org/abs/2010.07050v1
- Date: Tue, 13 Oct 2020 09:18:33 GMT
- Title: Modurec: Recommender Systems with Feature and Time Modulation
- Authors: Javier Maroto, Cl\'ement Vignac and Pascal Frossard
- Abstract summary: We propose Modurec: an autoencoder-based method that combines all available information using the feature-wise modulation mechanism.
We show on Movielens datasets that these modifications produce state-of-the-art results in most evaluated settings.
- Score: 50.51144496609274
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Current state of the art algorithms for recommender systems are mainly based
on collaborative filtering, which exploits user ratings to discover latent
factors in the data. These algorithms unfortunately do not make effective use
of other features, which can help solve two well identified problems of
collaborative filtering: cold start (not enough data is available for new users
or products) and concept shift (the distribution of ratings changes over time).
To address these problems, we propose Modurec: an autoencoder-based method that
combines all available information using the feature-wise modulation mechanism,
which has demonstrated its effectiveness in several fields. While time
information helps mitigate the effects of concept shift, the combination of
user and item features improve prediction performance when little data is
available. We show on Movielens datasets that these modifications produce
state-of-the-art results in most evaluated settings compared with standard
autoencoder-based methods and other collaborative filtering approaches.
Related papers
- An Efficient Multi-threaded Collaborative Filtering Approach in Recommendation System [0.0]
This research focuses on building a scalable recommendation system capable of handling numerous users efficiently.
A multithreaded similarity approach is employed to achieve this, where users are divided into independent threads that run in parallel.
This parallelization significantly reduces computation time compared to traditional methods, resulting in a faster, more efficient, and scalable recommendation system.
arXiv Detail & Related papers (2024-09-28T06:33:18Z) - Interactive Graph Convolutional Filtering [79.34979767405979]
Interactive Recommender Systems (IRS) have been increasingly used in various domains, including personalized article recommendation, social media, and online advertising.
These problems are exacerbated by the cold start problem and data sparsity problem.
Existing Multi-Armed Bandit methods, despite their carefully designed exploration strategies, often struggle to provide satisfactory results in the early stages.
Our proposed method extends interactive collaborative filtering into the graph model to enhance the performance of collaborative filtering between users and items.
arXiv Detail & Related papers (2023-09-04T09:02:31Z) - Towards Explainable Collaborative Filtering with Taste Clusters Learning [43.4512681951459]
Collaborative Filtering (CF) is a widely used and effective technique for recommender systems.
Adding explainability to recommendation models can not only increase trust in the decisionmaking process, but also have multiple benefits.
We propose a neat and effective Explainable Collaborative Filtering (ECF) model that leverages interpretable cluster learning.
arXiv Detail & Related papers (2023-04-27T03:08:15Z) - Broad Recommender System: An Efficient Nonlinear Collaborative Filtering
Approach [56.12815715932561]
We propose a new broad recommender system called Broad Collaborative Filtering (BroadCF)
Instead of Deep Neural Networks (DNNs), Broad Learning System (BLS) is used as a mapping function to learn the complex nonlinear relationships between users and items.
Extensive experiments conducted on seven benchmark datasets have confirmed the effectiveness of the proposed BroadCF algorithm.
arXiv Detail & Related papers (2022-04-20T01:25:08Z) - Compactness Score: A Fast Filter Method for Unsupervised Feature
Selection [66.84571085643928]
We propose a fast unsupervised feature selection method, named as, Compactness Score (CSUFS) to select desired features.
Our proposed algorithm seems to be more accurate and efficient compared with existing algorithms.
arXiv Detail & Related papers (2022-01-31T13:01:37Z) - Adaptive Sampling for Heterogeneous Rank Aggregation from Noisy Pairwise
Comparisons [85.5955376526419]
In rank aggregation problems, users exhibit various accuracy levels when comparing pairs of items.
We propose an elimination-based active sampling strategy, which estimates the ranking of items via noisy pairwise comparisons.
We prove that our algorithm can return the true ranking of items with high probability.
arXiv Detail & Related papers (2021-10-08T13:51:55Z) - Deep Variational Models for Collaborative Filtering-based Recommender
Systems [63.995130144110156]
Deep learning provides accurate collaborative filtering models to improve recommender system results.
Our proposed models apply the variational concept to injectity in the latent space of the deep architecture.
Results show the superiority of the proposed approach in scenarios where the variational enrichment exceeds the injected noise effect.
arXiv Detail & Related papers (2021-07-27T08:59:39Z) - BanditMF: Multi-Armed Bandit Based Matrix Factorization Recommender
System [0.0]
Multi-armed bandits (MAB) provide a principled online learning approach to attain the balance between exploration and exploitation.
collaborative filtering (CF) is arguably the earliest and most influential method in the recommender system.
BanditMF is designed to address two challenges in the multi-armed bandits algorithm and collaborative filtering.
arXiv Detail & Related papers (2021-06-21T07:35:39Z) - A concise method for feature selection via normalized frequencies [0.0]
In this paper, a concise method is proposed for universal feature selection.
The proposed method uses a fusion of the filter method and the wrapper method, rather than a combination of them.
The evaluation results show that the proposed method outperformed several state-of-the-art related works in terms of accuracy, precision, recall, F-score and AUC.
arXiv Detail & Related papers (2021-06-10T15:29:54Z) - Multi-Feature Discrete Collaborative Filtering for Fast Cold-start
Recommendation [31.69262747122024]
We propose a fast cold-start recommendation method, called Multi-Feature Discrete Collaborative Filtering (MFDCF)
Specifically, a low-rank self-weighted multi-feature fusion module is designed to adaptively project the multiple content features into binary hash codes.
MFDCF outperforms the state-of-the-arts on various aspects.
arXiv Detail & Related papers (2020-03-24T08:55:15Z)
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.