User-Specific Bicluster-based Collaborative Filtering: Handling Preference Locality, Sparsity and Subjectivity

• URL: http://arxiv.org/abs/2211.08366v1
• Date: Tue, 15 Nov 2022 18:10:52 GMT
• Title: User-Specific Bicluster-based Collaborative Filtering: Handling Preference Locality, Sparsity and Subjectivity
• Authors: Miguel G. Silva, Rui Henriques, Sara C. Madeira
• Abstract summary: Collaborative Filtering (CF) is the most common approach to build Recommender Systems. We propose USBFC, a Biclustering-based CF approach that creates user-specific models from strongly coherent and statistically significant rating patterns. USBFC achieves competitive predictive accuracy against state-of-the-art CF methods.
• Score: 1.0398909602421018
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Collaborative Filtering (CF), the most common approach to build Recommender Systems, became pervasive in our daily lives as consumers of products and services. However, challenges limit the effectiveness of Collaborative Filtering approaches when dealing with recommendation data, mainly due to the diversity and locality of user preferences, structural sparsity of user-item ratings, subjectivity of rating scales, and increasingly high item dimensionality and user bases. To answer some of these challenges, some authors proposed successful approaches combining CF with Biclustering techniques. This work assesses the effectiveness of Biclustering approaches for CF, comparing the impact of algorithmic choices, and identifies principles for superior Biclustering-based CF. As a result, we propose USBFC, a Biclustering-based CF approach that creates user-specific models from strongly coherent and statistically significant rating patterns, corresponding to subspaces of shared preferences across users. Evaluation on real-world data reveals that USBCF achieves competitive predictive accuracy against state-of-the-art CF methods. Moreover, USBFC successfully suppresses the main shortcomings of the previously proposed state-of-the-art biclustering-based CF by increasing coverage, and coclustering-based CF by strengthening subspace homogeneity.

Related papers

• Co-clustering for Federated Recommender System [33.70723179405055]
  Federated Recommender System (FRS) offers a solution that strikes a balance between providing high-quality recommendations and preserving user privacy. The presence of statistical heterogeneity in FRS, commonly observed due to personalized decision-making patterns, can pose challenges. We propose CoFedRec, a novel Co-clustering Federated Recommendation mechanism.
  arXiv  Detail & Related papers  (2024-11-03T21:32:07Z)
• Efficient and Robust Regularized Federated Recommendation [52.24782464815489]
  The recommender system (RSRS) addresses both user preference and privacy concerns. We propose a novel method that incorporates non-uniform gradient descent to improve communication efficiency. RFRecF's superior robustness compared to diverse baselines.
  arXiv  Detail & Related papers  (2024-11-03T12:10:20Z)
• Understanding and Improving Adversarial Collaborative Filtering for Robust Recommendation [60.719158008403376]
  Adversarial Collaborative Filtering (ACF) is widely recognized as an effective strategy for enhancing the robustness of recommender systems against poisoning attacks. Despite empirical successes, the theoretical understanding of ACF's effectiveness in terms of both performance and robustness remains unclear. We propose Personalized Magnitude Adversarial Collaborative Filtering (PamaCF)
  arXiv  Detail & Related papers  (2024-10-30T09:23:14Z)
• Data augmentation and refinement for recommender system: A semi-supervised approach using maximum margin matrix factorization [3.3525248693617207]
  We explore the data augmentation and refinement aspects of Maximum Margin Matrix Factorization (MMMF) for rating predictions. We exploit the inherent characteristics of CF algorithms to assess the confidence level of individual ratings. We propose a semi-supervised approach for rating augmentation based on self-training.
  arXiv  Detail & Related papers  (2023-06-22T17:17:45Z)
• Differentially Private Federated Clustering over Non-IID Data [59.611244450530315]
  clustering clusters (FedC) problem aims to accurately partition unlabeled data samples distributed over massive clients into finite clients under the orchestration of a server. We propose a novel FedC algorithm using differential privacy convergence technique, referred to as DP-Fed, in which partial participation and multiple clients are also considered. Various attributes of the proposed DP-Fed are obtained through theoretical analyses of privacy protection, especially for the case of non-identically and independently distributed (non-i.i.d.) data.
  arXiv  Detail & Related papers  (2023-01-03T05:38:43Z)
• Fed-CBS: A Heterogeneity-Aware Client Sampling Mechanism for Federated Learning via Class-Imbalance Reduction [76.26710990597498]
  We show that the class-imbalance of the grouped data from randomly selected clients can lead to significant performance degradation. Based on our key observation, we design an efficient client sampling mechanism, i.e., Federated Class-balanced Sampling (Fed-CBS) In particular, we propose a measure of class-imbalance and then employ homomorphic encryption to derive this measure in a privacy-preserving way.
  arXiv  Detail & Related papers  (2022-09-30T05:42:56Z)
• FedSPLIT: One-Shot Federated Recommendation System Based on Non-negative Joint Matrix Factorization and Knowledge Distillation [7.621960305708476]
  We present the first unsupervised one-shot federated CF implementation, named FedSPLIT, based on NMF joint factorization. FedSPLIT can obtain similar results than the state of the art (and even outperform it in certain situations) with a substantial decrease in the number of communications.
  arXiv  Detail & Related papers  (2022-05-04T23:42:14Z)
• Hypergraph Contrastive Collaborative Filtering [44.8586906335262]
  We propose a new self-supervised recommendation framework Hypergraph Contrastive Collaborative Filtering (HCCF) HCCF captures local and global collaborative relations with a hypergraph-enhanced cross-view contrastive learning architecture. Our model effectively integrates the hypergraph structure encoding with self-supervised learning to reinforce the representation quality of recommender systems.
  arXiv  Detail & Related papers  (2022-04-26T10:06:04Z)
• On the Convergence of Clustered Federated Learning [57.934295064030636]
  In a federated learning system, the clients, e.g. mobile devices and organization participants, usually have different personal preferences or behavior patterns. This paper proposes a novel weighted client-based clustered FL algorithm to leverage the client's group and each client in a unified optimization framework.
  arXiv  Detail & Related papers  (2022-02-13T02:39:19Z)

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.