CASE:用于大规模下次购物篮复购推荐的时间节奏感知集合编码 / CASE: Cadence-Aware Set Encoding for Large-Scale Next Basket Repurchase Recommendation
1️⃣ 一句话总结
这篇论文提出了一种名为CASE的新方法,它通过显式地建模用户购买商品的时间节奏规律,来更准确地预测用户下次会复购哪些商品,并在大规模实际应用中显著提升了推荐效果。
Repurchase behavior is a primary signal in large-scale retail recommendation, particularly in categories with frequent replenishment: many items in a user's next basket were previously purchased and their timing follows stable, item-specific cadences. Yet most next basket repurchase recommendation models represent history as a sequence of discrete basket events indexed by visit order, which cannot explicitly model elapsed calendar time or update item rankings as days pass between purchases. We present CASE (Cadence-Aware Set Encoding for next basket repurchase recommendation), which decouples item-level cadence learning from cross-item interaction, enabling explicit calendar-time modeling while remaining production-scalable. CASE represents each item's purchase history as a calendar-time signal over a fixed horizon, applies shared multi-scale temporal convolutions to capture recurring rhythms, and uses induced set attention to model cross-item dependencies with sub-quadratic complexity, allowing efficient batch inference at scale. Across three public benchmarks and a proprietary dataset, CASE consistently improves Precision, Recall, and NDCG at multiple cutoffs compared to strong next basket prediction baselines. In a production-scale evaluation with tens of millions of users and a large item catalog, CASE achieves up to 8.6% relative Precision and 9.9% Recall lift at top-5, demonstrating that scalable cadence-aware modeling yields measurable gains in both benchmark and industrial settings.
CASE:用于大规模下次购物篮复购推荐的时间节奏感知集合编码 / CASE: Cadence-Aware Set Encoding for Large-Scale Next Basket Repurchase Recommendation
这篇论文提出了一种名为CASE的新方法,它通过显式地建模用户购买商品的时间节奏规律,来更准确地预测用户下次会复购哪些商品,并在大规模实际应用中显著提升了推荐效果。
源自 arXiv: 2604.06718