REVIEW 9 cited by
Large Scale Product Graph Construction for Recommendation in E-commerce
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Large Scale Product Graph Construction for Recommendation in E-commerce
read the original abstract
Building a recommendation system that serves billions of users on daily basis is a challenging problem, as the system needs to make astronomical number of predictions per second based on real-time user behaviors with O(1) time complexity. Such kind of large scale recommendation systems usually rely heavily on pre-built index of products to speedup the recommendation service so that online user waiting time is un-noticeable. One important indexing structure is the product-product index, where one can retrieval a list of ranked products given a seed product. The index can be viewed as a weighted product-product graph. In this paper, we present our novel technologies to efficiently build such kind of indexed product graphs. In particular, we propose the Swing algorithm to capture the substitute relationships between products, which can utilize the substructures of user-item click bi-partitive graph. Then we propose the Surprise algorithm for the modeling of complementary product relationships, which utilizes product category information and solves the sparsity problem of user co-purchasing graph via clustering technique. Base on these two approaches, we can build the basis product graph for recommendation in Taobao. The approaches are evaluated comprehensively with both offline and online experiments, and the results demonstrate the effectiveness and efficiency of the work.
Forward citations
Cited by 9 Pith papers
-
Similar Users-Augmented Interest Network
SUIN improves CTR prediction by augmenting target user sequences with similar users' behaviors via embedding-based retrieval, user-specific position encoding, and user-aware target attention.
-
Beyond Static Collision Handling: Adaptive Semantic ID Learning for Multimodal Recommendation at Industrial Scale
AdaSID adaptively regulates semantic ID overlaps in multimodal recommendations to improve retrieval performance, codebook utilization, and downstream metrics like GMV.
-
NEXT: Reasoning-Driven Video Recommendation via a Vision-Language Model
NEXT, a reasoning-driven video recommendation framework with a custom-trained 8B VLM, yields +0.53% watch time and +0.51% distinct exposure in production A/B tests.
-
Text-Guided Visual Representation Learning for Robust Multimodal E-Commerce Recommendation
TGQ-Former uses metadata-guided hybrid queries and dual-gated modulation to improve visual token selection in multimodal e-commerce retrieval, raising average Hit Rate@100 by 6.04% over baselines.
-
CAPTS: Channel-Aware, Preference-Aligned Trigger Selection for Multi-Channel Item-to-Item Retrieval
CAPTS selects retrieval triggers by predicted downstream engagement per I2I channel and routes them jointly, reporting offline Recall@K gains and a small online time-spent lift.
-
SSRLive: Live Streaming Recommendation with Dynamic Semantic ID
SSRLive combines generative and discriminative modules with dynamic semantic IDs to improve live streaming recommendations, reporting gains of +3.38% watch time, +0.72% GMV, +3.12% follower growth, and +2.92% interact...
-
MARS: Multi-Agent Re-ranking for Repeat-Order Food Delivery Recommendation
A modular LLM-plus-collaborative-filtering pipeline matches or slightly beats specialized food-delivery baselines on repeat-order ranking, with backbone strength and inference-time reasoning driving the gains.
-
From Extraction to Navigation: Progressive Retrieval with Indirectly Infinite Depth
IID-Nav enables progressive retrieval in large-scale recommenders by treating it as iterative goal-driven graph traversal with recursive state evolution supporting unlimited depth without rising inference cost.
-
POEM: Partial-Order Enhanced Real-Time Sequential Modeling for Recommendation
POEM constructs dynamic partial-order sequences from multi-task ranking scores to enhance real-time sequential recommendation, reporting 0.2% watch-time lifts when deployed on Kuaishou.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.