ID and Graph View Contrastive Learning with Multi-View Attention Fusion for Sequential Recommendation

• URL: http://arxiv.org/abs/2604.14114v1
• Date: Wed, 15 Apr 2026 17:36:19 GMT
• Title: ID and Graph View Contrastive Learning with Multi-View Attention Fusion for Sequential Recommendation
• Abstract summary: We propose Multi-View Contrastive learning for sequential recommendation (MVCrec)<n>MVCrec incorporates three contrastive objectives: within the sequential view, within the graph view, and across views.<n>To effectively fuse the learned representations, we introduce a multi-view attention fusion module.
• Score: 3.3128364121053973
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Sequential recommendation has become increasingly prominent in both academia and industry, particularly in e-commerce. The primary goal is to extract user preferences from historical interaction sequences and predict items a user is likely to engage with next. Recent advances have leveraged contrastive learning and graph neural networks to learn more expressive representations from interaction histories -- graphs capture relational structure between nodes, while ID-based representations encode item-specific information. However, few studies have explored multi-view contrastive learning between ID and graph perspectives to jointly improve user and item representations, especially in settings where only interaction data is available without auxiliary information. To address this gap, we propose Multi-View Contrastive learning for sequential recommendation (MVCrec), a framework that integrates complementary signals from both sequential (ID-based) and graph-based views. MVCrec incorporates three contrastive objectives: within the sequential view, within the graph view, and across views. To effectively fuse the learned representations, we introduce a multi-view attention fusion module that combines global and local attention mechanisms to estimate the likelihood of a target user purchasing a target item. Comprehensive experiments on five real-world benchmark datasets demonstrate that MVCrec consistently outperforms 11 state-of-the-art baselines, achieving improvements of up to 14.44\% in NDCG@10 and 9.22\% in HitRatio@10 over the strongest baseline. Our code and datasets are available at https://github.com/sword-Lz/MMCrec.

Related papers

• Recommendation System in Advertising and Streaming Media: Unsupervised Data Enhancement Sequence Suggestions [2.9633211091806997]
  We introduce a novel framework, Global Unsupervised Data-Augmentation (UDA4SR), which adopts a graph contrastive learning perspective to generate robust item embeddings for sequential recommendation.<n>Our approach begins by integrating Generative Adrial Networks (GANs) for data augmentation, which serves as the first step to enhance the diversity and richness of the training data.<n>To model users' dynamic and diverse interests more effectively, we enhance the CapsNet module with a novel target-attention mechanism.
  arXiv  Detail & Related papers  (2025-03-23T06:30:48Z)
• Graph Contrastive Learning on Multi-label Classification for Recommendations [34.785207813971134]
  We propose a model called Graph Contrastive Learning for Multi-label Classification (MCGCL)<n>MCGCL leverages contrastive learning to enhance recommendation effectiveness.<n>We assess the performance using real-world datasets from Amazon Reviews in multi-label classification tasks.
  arXiv  Detail & Related papers  (2025-01-13T00:29:29Z)
• Multi-Channel Hypergraph Contrastive Learning for Matrix Completion [35.98355220028173]
  Graph neural networks (GNNs) have been widely used in matrix completion, which captures users' preferences over items.<n>We propose a Multi-Channel Hypergraph Contrastive Learning framework for matrix completion, named MHCL.<n>Experiments on five public datasets demonstrate that the proposed method significantly outperforms the current state-of-the-art approaches.
  arXiv  Detail & Related papers  (2024-11-02T22:59:36Z)
• Enhancing Graph Contrastive Learning with Reliable and Informative Augmentation for Recommendation [84.45144851024257]
  We propose a novel framework that aims to enhance graph contrastive learning by constructing contrastive views with stronger collaborative information via discrete codes.<n>The core idea is to map users and items into discrete codes rich in collaborative information for reliable and informative contrastive view generation.
  arXiv  Detail & Related papers  (2024-09-09T14:04:17Z)
• GUESR: A Global Unsupervised Data-Enhancement with Bucket-Cluster Sampling for Sequential Recommendation [58.6450834556133]
  We propose graph contrastive learning to enhance item representations with complex associations from the global view. We extend the CapsNet module with the elaborately introduced target-attention mechanism to derive users' dynamic preferences. Our proposed GUESR could not only achieve significant improvements but also could be regarded as a general enhancement strategy.
  arXiv  Detail & Related papers  (2023-03-01T05:46:36Z)
• Cross-view Graph Contrastive Representation Learning on Partially Aligned Multi-view Data [52.491074276133325]
  Multi-view representation learning has developed rapidly over the past decades and has been applied in many fields. We propose a new cross-view graph contrastive learning framework, which integrates multi-view information to align data and learn latent representations. Experiments conducted on several real datasets demonstrate the effectiveness of the proposed method on the clustering and classification tasks.
  arXiv  Detail & Related papers  (2022-11-08T09:19:32Z)
• ACTIVE:Augmentation-Free Graph Contrastive Learning for Partial Multi-View Clustering [52.491074276133325]
  We propose an augmentation-free graph contrastive learning framework to solve the problem of partial multi-view clustering. The proposed approach elevates instance-level contrastive learning and missing data inference to the cluster-level, effectively mitigating the impact of individual missing data on clustering.
  arXiv  Detail & Related papers  (2022-03-01T02:32:25Z)
• Deep Contrastive Learning for Multi-View Network Embedding [20.035449838566503]
  Multi-view network embedding aims at projecting nodes in the network to low-dimensional vectors. Most contrastive learning-based methods mostly rely on high-quality graph embedding. We design a novel node-to-node Contrastive learning framework for Multi-view network Embedding (CREME)
  arXiv  Detail & Related papers  (2021-08-16T06:29:18Z)
• 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.