Federated Multi-view Matrix Factorization for Personalized
Recommendations
- URL: http://arxiv.org/abs/2004.04256v1
- Date: Wed, 8 Apr 2020 21:07:50 GMT
- Title: Federated Multi-view Matrix Factorization for Personalized
Recommendations
- Authors: Adrian Flanagan, Were Oyomno, Alexander Grigorievskiy, Kuan Eeik Tan,
Suleiman A. Khan, and Muhammad Ammad-Ud-Din
- Abstract summary: We introduce the federated multi-view matrix factorization method that extends the federated learning framework to matrix factorization with multiple data sources.
Our method is able to learn the multi-view model without transferring the user's personal data to a central server.
- Score: 53.74747022749739
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: We introduce the federated multi-view matrix factorization method that
extends the federated learning framework to matrix factorization with multiple
data sources. Our method is able to learn the multi-view model without
transferring the user's personal data to a central server. As far as we are
aware this is the first federated model to provide recommendations using
multi-view matrix factorization. The model is rigorously evaluated on three
datasets on production settings. Empirical validation confirms that federated
multi-view matrix factorization outperforms simpler methods that do not take
into account the multi-view structure of the data, in addition, it demonstrates
the usefulness of the proposed method for the challenging prediction tasks of
cold-start federated recommendations.
Related papers
- BiVRec: Bidirectional View-based Multimodal Sequential Recommendation [55.87443627659778]
We propose an innovative framework, BivRec, that jointly trains the recommendation tasks in both ID and multimodal views.
BivRec achieves state-of-the-art performance on five datasets and showcases various practical advantages.
arXiv Detail & Related papers (2024-02-27T09:10:41Z) - Multi-view Subspace Clustering via An Adaptive Consensus Graph Filter [4.3507834596906125]
Multiview subspace clustering (MVSC) has attracted an increasing amount of attention in recent years.
In this paper, we assume the existence of a consensus reconstruction coefficient matrix and then use it to build a consensus graph filter.
In each view, the filter is employed for smoothing the data and designing a regularizer for the reconstruction coefficient matrix.
arXiv Detail & Related papers (2024-01-30T02:03:18Z) - A Novel Approach for Effective Multi-View Clustering with
Information-Theoretic Perspective [24.630259061774836]
This study presents a new approach called Sufficient Multi-View Clustering (SUMVC) that examines the multi-view clustering framework from an information-theoretic standpoint.
Firstly, we develop a simple and reliable multi-view clustering method SCMVC that employs variational analysis to generate consistent information.
Secondly, we propose a sufficient representation lower bound to enhance consistent information and minimise unnecessary information among views.
arXiv Detail & Related papers (2023-09-25T09:41:11Z) - Semi-supervised multi-view concept decomposition [30.699496411869834]
Concept Factorization (CF) has demonstrated superior performance in multi-view clustering tasks.
We propose a novel semi-supervised multi-view concept factorization model, named SMVCF.
We conduct experiments on four diverse datasets to evaluate the performance of SMVCF.
arXiv Detail & Related papers (2023-07-03T10:50:44Z) - Multi-View Class Incremental Learning [57.14644913531313]
Multi-view learning (MVL) has gained great success in integrating information from multiple perspectives of a dataset to improve downstream task performance.
This paper investigates a novel paradigm called multi-view class incremental learning (MVCIL), where a single model incrementally classifies new classes from a continual stream of views.
arXiv Detail & Related papers (2023-06-16T08:13:41Z) - One-step Multi-view Clustering with Diverse Representation [47.41455937479201]
We propose a one-step multi-view clustering with diverse representation method, which incorporates multi-view learning and $k$-means into a unified framework.
We develop an efficient optimization algorithm with proven convergence to solve the resultant problem.
arXiv Detail & Related papers (2023-06-08T02:52:24Z) - Unified Multi-View Orthonormal Non-Negative Graph Based Clustering
Framework [74.25493157757943]
We formulate a novel clustering model, which exploits the non-negative feature property and incorporates the multi-view information into a unified joint learning framework.
We also explore, for the first time, the multi-model non-negative graph-based approach to clustering data based on deep features.
arXiv Detail & Related papers (2022-11-03T08:18:27Z) - Learning Inter- and Intra-manifolds for Matrix Factorization-based
Multi-Aspect Data Clustering [3.756550107432323]
Clustering on the data with multiple aspects, such as multi-view or multi-type relational data, has become popular in recent years.
We propose to include the inter-manifold in the NMF framework, utilizing the distance information of data points of different data types (or views) to learn the diverse manifold for data clustering.
Results on several datasets demonstrate that the proposed method outperforms the state-of-the-art multi-aspect data clustering methods in both accuracy and efficiency.
arXiv Detail & Related papers (2020-09-07T02:21:08Z) - Sequential Recommendation with Self-Attentive Multi-Adversarial Network [101.25533520688654]
We present a Multi-Factor Generative Adversarial Network (MFGAN) for explicitly modeling the effect of context information on sequential recommendation.
Our framework is flexible to incorporate multiple kinds of factor information, and is able to trace how each factor contributes to the recommendation decision over time.
arXiv Detail & Related papers (2020-05-21T12:28:59Z)
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.