MixRec: Heterogeneous Graph Collaborative Filtering

• URL: http://arxiv.org/abs/2412.13825v3
• Date: Wed, 25 Dec 2024 02:33:14 GMT
• Title: MixRec: Heterogeneous Graph Collaborative Filtering
• Authors: Lianghao Xia, Meiyan Xie, Yong Xu, Chao Huang,
• Abstract summary: We present a graph collaborative filtering model MixRec to disentangling users' multi-behavior interaction patterns. Our model achieves this by incorporating intent disentanglement and multi-behavior modeling. We also introduce a novel contrastive learning paradigm that adaptively explores the advantages of self-supervised data augmentation.
• Score: 21.96510707666373
• License:
• Abstract: For modern recommender systems, the use of low-dimensional latent representations to embed users and items based on their observed interactions has become commonplace. However, many existing recommendation models are primarily designed for coarse-grained and homogeneous interactions, which limits their effectiveness in two critical dimensions. Firstly, these models fail to leverage the relational dependencies that exist across different types of user behaviors, such as page views, collects, comments, and purchases. Secondly, they struggle to capture the fine-grained latent factors that drive user interaction patterns. To address these limitations, we present a heterogeneous graph collaborative filtering model MixRec that excels at disentangling users' multi-behavior interaction patterns and uncovering the latent intent factors behind each behavior. Our model achieves this by incorporating intent disentanglement and multi-behavior modeling, facilitated by a parameterized heterogeneous hypergraph architecture. Furthermore, we introduce a novel contrastive learning paradigm that adaptively explores the advantages of self-supervised data augmentation, thereby enhancing the model's resilience against data sparsity and expressiveness with relation heterogeneity. To validate the efficacy of MixRec, we conducted extensive experiments on three public datasets. The results clearly demonstrate its superior performance, significantly outperforming various state-of-the-art baselines. Our model is open-sourced and available at: https://github.com/HKUDS/MixRec.

Related papers

• Graph Signal Diffusion Model for Collaborative Filtering [22.727100820178414]
  Collaborative filtering is a critical technique in recommender systems. Existing studies on diffusion model lack effective solutions for modeling implicit feedback. We propose a novel Graph Signal Diffusion Model for Collaborative Filtering (named GiffCF)
  arXiv  Detail & Related papers  (2023-11-15T07:25:14Z)
• AdaptSSR: Pre-training User Model with Augmentation-Adaptive Self-Supervised Ranking [19.1857792382924]
  We propose Augmentation-Supervised Ranking (AdaptSSR) to replace the contrastive learning task. We adopt a multiple pairwise ranking loss which trains the user model to capture the similarity orders between the implicitly augmented view, the explicitly augmented view, and views from other users. Experiments on both public and industrial datasets with six downstream tasks verify the effectiveness of AdaptSSR.
  arXiv  Detail & Related papers  (2023-10-15T02:19:28Z)
• Interactive Graph Convolutional Filtering [79.34979767405979]
  Interactive Recommender Systems (IRS) have been increasingly used in various domains, including personalized article recommendation, social media, and online advertising. These problems are exacerbated by the cold start problem and data sparsity problem. Existing Multi-Armed Bandit methods, despite their carefully designed exploration strategies, often struggle to provide satisfactory results in the early stages. Our proposed method extends interactive collaborative filtering into the graph model to enhance the performance of collaborative filtering between users and items.
  arXiv  Detail & Related papers  (2023-09-04T09:02:31Z)
• Challenging the Myth of Graph Collaborative Filtering: a Reasoned and Reproducibility-driven Analysis [50.972595036856035]
  We present a code that successfully replicates results from six popular and recent graph recommendation models. We compare these graph models with traditional collaborative filtering models that historically performed well in offline evaluations. By investigating the information flow from users' neighborhoods, we aim to identify which models are influenced by intrinsic features in the dataset structure.
  arXiv  Detail & Related papers  (2023-08-01T09:31:44Z)
• A Graph-Enhanced Click Model for Web Search [67.27218481132185]
  We propose a novel graph-enhanced click model (GraphCM) for web search. We exploit both intra-session and inter-session information for the sparsity and cold-start problems.
  arXiv  Detail & Related papers  (2022-06-17T08:32:43Z)
• Multi-Behavior Enhanced Recommendation with Cross-Interaction Collaborative Relation Modeling [42.6279077675585]
  This work proposes a Graph Neural Multi-Behavior Enhanced Recommendation framework. It explicitly models the dependencies between different types of user-item interactions under a graph-based message passing architecture. Experiments on real-world recommendation datasets show that our GNMR consistently outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-01-07T03:12:37Z)
• Deep Variational Models for Collaborative Filtering-based Recommender Systems [63.995130144110156]
  Deep learning provides accurate collaborative filtering models to improve recommender system results. Our proposed models apply the variational concept to injectity in the latent space of the deep architecture. Results show the superiority of the proposed approach in scenarios where the variational enrichment exceeds the injected noise effect.
  arXiv  Detail & Related papers  (2021-07-27T08:59:39Z)
• Neural Graph Matching based Collaborative Filtering [13.086302251856756]
  We identify two different types of attribute interactions, inner and cross interactions. Existing models do not distinguish these two types of attribute interactions. We propose a neural Graph Matching based Collaborative Filtering model (GMCF) Our model outperforms state-of-the-art models.
  arXiv  Detail & Related papers  (2021-05-10T01:51:46Z)
• Dynamic Graph Collaborative Filtering [64.87765663208927]
  Dynamic recommendation is essential for recommender systems to provide real-time predictions based on sequential data. Here we propose Dynamic Graph Collaborative Filtering (DGCF), a novel framework leveraging dynamic graphs to capture collaborative and sequential relations. Our approach achieves higher performance when the dataset contains less action repetition, indicating the effectiveness of integrating dynamic collaborative information.
  arXiv  Detail & Related papers  (2021-01-08T04:16:24Z)
• Disentangled Graph Collaborative Filtering [100.26835145396782]
  Disentangled Graph Collaborative Filtering (DGCF) is a new model for learning informative representations of users and items from interaction data. By modeling a distribution over intents for each user-item interaction, we iteratively refine the intent-aware interaction graphs and representations. DGCF achieves significant improvements over several state-of-the-art models like NGCF, DisenGCN, and MacridVAE.
  arXiv  Detail & Related papers  (2020-07-03T15:37:25Z)

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.