Adapting Knowledge Graphs for Behavior Denoising in Sequential Recommendation

精选理由

AdaptedKG uses knowledge graphs to improve sequential recommendation by denoising behavior, which is a unique approach compared to other methods. It's worth checking out if you're interested in knowledge graph applications in recommendation systems.

AI 摘要

This paper introduces AdaptedKG, a method for behavior denoising in sequential recommendation by using knowledge graphs. It identifies unusual relational paths and calibrates interaction support within a local KG view, improving retention coefficients and reweighting target losses. Experiments demonstrate gains with standard and behavior-denoising recommenders.

原文 · arXiv cs.AI

Sequential recommendation predicts the next item from a user's interaction history, but not every interaction is equally informative. Real logs combine persistent preferences with temporary needs, exploration, and incidental behavior, so some interactions can distort history representations or provide unreliable supervision. Existing denoising methods judge such interactions mainly from co-occurrence, order, or model predictions, without explicit evidence from relations between items. Knowledge graphs (KGs) offer this evidence, but item popularity, graph degree, uneven coverage, and widely shared entities can inflate connectivity and bias reliability estimates. Here we present AdaptedKG, which derives calibrated KG evidence for each training example without adding graph representations to the recommendation model. It first compares the observed context with structurally matched alternatives to identify relational paths that are unusually prominent and uses them to build a local KG view. It then compares each interaction with structurally matched reference items to calibrate its support within that view. The resulting retention coefficients gate historical representations and reweight target losses. All sample-specific scores are computed offline using training interactions and a fixed KG, so the backbone remains unchanged and no KG access is required at inference. Experiments show gains with a standard sequential recommender and multiple behavior-denoising sequential recommenders.