DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation

• URL: http://arxiv.org/abs/2411.09181v1
• Date: Thu, 14 Nov 2024 04:39:30 GMT
• Title: DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation
• Authors: Xinyu He, Jose Sepulveda, Mostafa Rahmani, Alyssa Woo, Fei Wang, Hanghang Tong,
• Abstract summary: We introduce a simple yet effective mechanism for generating time-aware user/item embeddings. We propose two strategies for denoising bipartite temporal graph in recommender systems.
• Score: 38.87538556340487
• License:
• Abstract: Due to the difficulty of acquiring large-scale explicit user feedback, implicit feedback (e.g., clicks or other interactions) is widely applied as an alternative source of data, where user-item interactions can be modeled as a bipartite graph. Due to the noisy and biased nature of implicit real-world user-item interactions, identifying and rectifying noisy interactions are vital to enhance model performance and robustness. Previous works on purifying user-item interactions in collaborative filtering mainly focus on mining the correlation between user/item embeddings and noisy interactions, neglecting the benefit of temporal patterns in determining noisy interactions. Time information, while enhancing the model utility, also bears its natural advantage in helping to determine noisy edges, e.g., if someone usually watches horror movies at night and talk shows in the morning, a record of watching a horror movie in the morning is more likely to be noisy interaction. Armed with this observation, we introduce a simple yet effective mechanism for generating time-aware user/item embeddings and propose two strategies for denoising bipartite temporal graph in recommender systems (DeBaTeR): the first is through reweighting the adjacency matrix (DeBaTeR-A), where a reliability score is defined to reweight the edges through both soft assignment and hard assignment; the second is through reweighting the loss function (DeBaTeR-L), where weights are generated to reweight user-item samples in the losses. Extensive experiments have been conducted to demonstrate the efficacy of our methods and illustrate how time information indeed helps identifying noisy edges.

Related papers

• Personalized Denoising Implicit Feedback for Robust Recommender System [60.719158008403376]
  We show that for a given user, there is a clear distinction between normal and noisy interactions in the user's personal loss distribution. We propose a resampling strategy to Denoise using the user's Personal Loss distribution, named PLD, which reduces the probability of noisy interactions being optimized.
  arXiv  Detail & Related papers  (2025-02-01T07:13:06Z)
• Robust Noisy Correspondence Learning via Self-Drop and Dual-Weight [11.523154025649758]
  Crowd-sourcing or web crawling introduces mismatched pairs. Current approaches leverage the effect of deep neural networks to distinguish noise and perform re-weighting. We propose a novel self-drop and dual-weight approach, which achieves elaborate data processing by qua- Partitioning the data.
  arXiv  Detail & Related papers  (2024-12-09T03:06:10Z)
• Comparative Performance of Collaborative Bandit Algorithms: Effect of Sparsity and Exploration Intensity [0.6526824510982802]
  Collaborative bandits aim to improve the performance of contextual bandits by introducing relationships between arms (or items) This paper offers a comprehensive analysis of collaborative bandit algorithms and provides a thorough comparison of their performance.
  arXiv  Detail & Related papers  (2024-10-15T22:09:21Z)
• Graph Collaborative Signals Denoising and Augmentation for Recommendation [75.25320844036574]
  We propose a new graph adjacency matrix that incorporates user-user and item-item correlations. We show that the inclusion of user-user and item-item correlations can improve recommendations for users with both abundant and insufficient interactions.
  arXiv  Detail & Related papers  (2023-04-06T19:43:37Z)
• Neighbor Based Enhancement for the Long-Tail Ranking Problem in Video Rank Models [0.0]
  We propose a novel neighbor enhancement structure to help train the representation of the target user or item. Experiments on the well-known public dataset MovieLens 1M demonstrate the efficiency of the method.
  arXiv  Detail & Related papers  (2023-02-16T07:38:51Z)
• DisenHCN: Disentangled Hypergraph Convolutional Networks for Spatiotemporal Activity Prediction [53.76601630407521]
  We propose a hypergraph network model called DisenHCN to bridge the gaps in existing solutions. In particular, we first unify fine-grained user similarity and the complex matching between user preferences andtemporal activity into a heterogeneous hypergraph. We then disentangle the user representations into different aspects (location-aware, time-aware, and activity-aware) and aggregate corresponding aspect's features on the constructed hypergraph.
  arXiv  Detail & Related papers  (2022-08-14T06:51:54Z)
• Robust Contrastive Learning against Noisy Views [79.71880076439297]
  We propose a new contrastive loss function that is robust against noisy views. We show that our approach provides consistent improvements over the state-of-the-art image, video, and graph contrastive learning benchmarks.
  arXiv  Detail & Related papers  (2022-01-12T05:24:29Z)
• Learning Dual Dynamic Representations on Time-Sliced User-Item Interaction Graphs for Sequential Recommendation [62.30552176649873]
  We devise a novel Dynamic Representation Learning model for Sequential Recommendation (DRL-SRe) To better model the user-item interactions for characterizing the dynamics from both sides, the proposed model builds a global user-item interaction graph for each time slice. To enable the model to capture fine-grained temporal information, we propose an auxiliary temporal prediction task over consecutive time slices.
  arXiv  Detail & Related papers  (2021-09-24T07:44:27Z)
• Robust Correlation Tracking via Multi-channel Fused Features and Reliable Response Map [10.079856376445598]
  This paper proposes a robust correlation tracking algorithm (RCT) based on two ideas. First, we propose a method to fuse features in order to more naturally describe the gradient and color information of the tracked object. Second, we present a novel strategy to significantly reduce noise in the response map and therefore ease the problem of model drift.
  arXiv  Detail & Related papers  (2020-11-25T07:15:03Z)

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.