A Privacy-Preserving Framework with Multi-Modal Data for Cross-Domain Recommendation

• URL: http://arxiv.org/abs/2403.03600v1
• Date: Wed, 6 Mar 2024 10:40:08 GMT
• Title: A Privacy-Preserving Framework with Multi-Modal Data for Cross-Domain Recommendation
• Authors: Li Wang, Lei Sang, Quangui Zhang, Qiang Wu, Min Xu
• Abstract summary: Cross-domain recommendation (CDR) aims to enhance recommendation accuracy in a target domain with sparse data. We propose a Privacy-Preserving Framework with Multi-Modal Data for Cross-Domain Recommendation, called P2M2-CDR.
• Score: 13.33679167416221
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Cross-domain recommendation (CDR) aims to enhance recommendation accuracy in a target domain with sparse data by leveraging rich information in a source domain, thereby addressing the data-sparsity problem. Some existing CDR methods highlight the advantages of extracting domain-common and domain-specific features to learn comprehensive user and item representations. However, these methods can't effectively disentangle these components as they often rely on simple user-item historical interaction information (such as ratings, clicks, and browsing), neglecting the rich multi-modal features. Additionally, they don't protect user-sensitive data from potential leakage during knowledge transfer between domains. To address these challenges, we propose a Privacy-Preserving Framework with Multi-Modal Data for Cross-Domain Recommendation, called P2M2-CDR. Specifically, we first design a multi-modal disentangled encoder that utilizes multi-modal information to disentangle more informative domain-common and domain-specific embeddings. Furthermore, we introduce a privacy-preserving decoder to mitigate user privacy leakage during knowledge transfer. Local differential privacy (LDP) is utilized to obfuscate the disentangled embeddings before inter-domain exchange, thereby enhancing privacy protection. To ensure both consistency and differentiation among these obfuscated disentangled embeddings, we incorporate contrastive learning-based domain-inter and domain-intra losses. Extensive Experiments conducted on four real-world datasets demonstrate that P2M2-CDR outperforms other state-of-the-art single-domain and cross-domain baselines.

Related papers

• Federated Graph Learning for Cross-Domain Recommendation [33.33321213257222]
  Cross-domain recommendation (CDR) offers a promising solution to the data sparsity problem by enabling knowledge transfer across source and target domains. We propose FedGCDR, a novel graph learning framework that securely and effectively leverages positive knowledge from multiple source domains. We conduct extensive experiments on 16 popular domains of the Amazon dataset, demonstrating that FedGCDR significantly outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-10-10T12:19:51Z)
• Improving Intrusion Detection with Domain-Invariant Representation Learning in Latent Space [4.871119861180455]
  We introduce a two-phase representation learning technique using multi-task learning. We disentangle the latent space by minimizing the mutual information between the prior and latent space. We assess the model's efficacy across multiple cybersecurity datasets.
  arXiv  Detail & Related papers  (2023-12-28T17:24:13Z)
• FedDCSR: Federated Cross-domain Sequential Recommendation via Disentangled Representation Learning [17.497009723665116]
  We propose FedDCSR, a novel cross-domain sequential recommendation framework via disentangled representation learning. We introduce an approach called inter-intra domain sequence representation disentanglement (SRD) to disentangle user sequence features into domain-shared and domain-exclusive features. In addition, we design an intra domain contrastive infomax (CIM) strategy to learn richer domain-exclusive features of users by performing data augmentation on user sequences.
  arXiv  Detail & Related papers  (2023-09-15T14:23:20Z)
• Exploiting Graph Structured Cross-Domain Representation for Multi-Domain Recommendation [71.45854187886088]
  Multi-domain recommender systems benefit from cross-domain representation learning and positive knowledge transfer. We use temporal intra- and inter-domain interactions as contextual information for our method called MAGRec. We perform experiments on publicly available datasets in different scenarios where MAGRec consistently outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-02-12T19:51:32Z)
• Diverse Preference Augmentation with Multiple Domains for Cold-start Recommendations [92.47380209981348]
  We propose a Diverse Preference Augmentation framework with multiple source domains based on meta-learning. We generate diverse ratings in a new domain of interest to handle overfitting on the case of sparse interactions. These ratings are introduced into the meta-training procedure to learn a preference meta-learner, which produces good generalization ability.
  arXiv  Detail & Related papers  (2022-04-01T10:10:50Z)
• A cross-domain recommender system using deep coupled autoencoders [77.86290991564829]
  Two novel coupled autoencoder-based deep learning methods are proposed for cross-domain recommendation. The first method aims to simultaneously learn a pair of autoencoders in order to reveal the intrinsic representations of the items in the source and target domains. The second method is derived based on a new joint regularized optimization problem, which employs two autoencoders to generate in a deep and non-linear manner the user and item-latent factors.
  arXiv  Detail & Related papers  (2021-12-08T15:14:26Z)
• Disentangled Unsupervised Image Translation via Restricted Information Flow [61.44666983942965]
  Many state-of-art methods hard-code the desired shared-vs-specific split into their architecture. We propose a new method that does not rely on inductive architectural biases. We show that the proposed method achieves consistently high manipulation accuracy across two synthetic and one natural dataset.
  arXiv  Detail & Related papers  (2021-11-26T00:27:54Z)
• Unsupervised Multi-Source Domain Adaptation for Person Re-Identification [39.817734080890695]
  Unsupervised domain adaptation (UDA) methods for person re-identification (re-ID) aim at transferring re-ID knowledge from labeled source data to unlabeled target data. We introduce the multi-source concept into UDA person re-ID field, where multiple source datasets are used during training. The proposed method outperforms state-of-the-art UDA person re-ID methods by a large margin, and even achieves comparable performance to the supervised approaches without any post-processing techniques.
  arXiv  Detail & Related papers  (2021-04-27T03:33:35Z)
• Domain Conditioned Adaptation Network [90.63261870610211]
  We propose a Domain Conditioned Adaptation Network (DCAN) to excite distinct convolutional channels with a domain conditioned channel attention mechanism. This is the first work to explore the domain-wise convolutional channel activation for deep DA networks.
  arXiv  Detail & Related papers  (2020-05-14T04:23:24Z)
• Mind the Gap: Enlarging the Domain Gap in Open Set Domain Adaptation [65.38975706997088]
  Open set domain adaptation (OSDA) assumes the presence of unknown classes in the target domain. We show that existing state-of-the-art methods suffer a considerable performance drop in the presence of larger domain gaps. We propose a novel framework to specifically address the larger domain gaps.
  arXiv  Detail & Related papers  (2020-03-08T14:20:24Z)

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.