Disentangled Multi-Graph Convolution for Cross-Domain Recommendation

Abstract

Listen

Translate article

Data sparsity poses a significant challenge for recommendation systems, prompting the research of cross-domain recommendation ( CDR ). CDR aims to leverage more user-item interaction information from source domains to improve the recommendation performance in the target domain. However, a major challenge in CDR is the identification of transferable features. Traditional CDR methods struggle to distinguish between the various features of users, including domain-invariant features that are effective for feature transfer and domain-specific features that are detrimental to cross-domain information transfer. In this paper, we aim to disentangle domain-invariant features and domain-specific features and effectively utilize these different features. This enables effective domain-to-domain information transfer by only transferring domain-invariant features while still considering the role of domain-specific features within their respective domains. Based on the superiority of graph structural feature learning and disentangled represent learning, we propose \(\mathbf{DMGCDR}\) —a model that learns D isentangled user feature representations and constructs a M ulti- G raph network for bidirectional knowledge transfer of shared features for CDR . Specifically, we designed two regularization terms to disentangle domain-invariant features and domain-specific features. Subsequently, we established a multi-graph convolutional network to enhance domain-specific features within single-domain graphs and transfer domain-invariant features across cross-domain graphs. Our approach also includes designing feature constraints to enhance the combination of features derived from different graphs and to uncover potential correlations among them. Extensive experiments on real-world datasets have demonstrated that our model significantly outperforms state-of-the-art cross-domain recommendation approaches.