利用时间模式识别并去除推荐系统中的噪声交互,提升模型准确性。
DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation
- 基于时间信息生成用户与物品的时序嵌入,增强对噪声边的识别能力。
- 提出两种去噪策略:重加权邻接矩阵与重加权损失函数,均显著提升性能。
- 适合关注个性化推荐中数据质量优化的研究者与工程师。
由于难以获取大规模显式用户反馈,隐式反馈(如点击或其他交互)被广泛用作替代数据源,用户-物品交互可建模为二分图。由于现实世界中用户-物品交互具有噪声和偏差,识别并修正噪声交互对于提升模型性能和鲁棒性至关重要。以往在协同过滤中净化用户-物品交互的工作主要聚焦于挖掘用户/物品嵌入与噪声交互之间的相关性,忽略了时间模式在判断噪声交互方面的优势。时间信息不仅能增强模型实用性,还能帮助识别噪声边——例如,若某人通常晚上看恐怖片、早上看脱口秀,则早上观看恐怖片的记录更可能是噪声交互。基于此观察,我们提出一种简单而有效的机制,用于生成时序感知的用户/物品嵌入,并提出两种在推荐系统中去噪二分时序图的方法(DeBaTeR):一是通过重加权邻接矩阵(DeBaTeR-A),定义可靠性分数,结合软分配与硬分配重加权边;二是通过重加权损失函数(DeBaTeR-L),生成权重以调整损失中用户-物品样本的重要性。大量实验验证了方法的有效性,表明时间信息确实有助于识别噪声边。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。