Refining Graph Representation for Cross-Domain Recommendation Based on Edge Pruning in Latent Space

Abstract

In this paper, we present refining graph representation for cross-domain recommendation (CDR) based on edge pruning considering feature distribution in a latent space. Conventional graph-based CDR methods have utilized all ratings and purchase histories of user's products. However, some items purchased by users are not related to the domain for recommendation, and this information becomes noise when making CDR. So, the proposed method introduces edge pruning into the latest graph-based CDR method to refine graph representation. To compare the item embedding features calculated in different domains, we construct a latent space and perform edge pruning through their correlations. Additionally, we introduce a state-of-the-art graph neural network into the graph construction of the proposed method that considers the interactions between users and items thereby obtaining effective embedding features in a domain. This makes it possible to consider domain-specific user preferences and estimate embedding features with high-expressive power. Furthermore, to compare the embedding features of items in the two domains, we construct their latent spaces and project them. Edge pruning is performed using the correlation of items between the two domains on the latent space. We obtain cross domain specific graph representation through edge pruning, which improves the performance by considering the relationship between both items across domains. To the best of our knowledge, no study in the CDR field focuses on eliminating unnecessary node information. We have demonstrated the effectiveness of the proposed method by comparing several graph-based state-of-the-art methods.