Path-based Deep Network for Candidate Item Matching in Recommenders
Houyi Li, Zhihong Chen, Chenliang Li, Rong Xiao, Hongbo Deng, Peng Zhang, Yongchao Liu, Haihong Tang
Abstract
The large-scale recommender system mainly consists of two stages: matching and ranking. The matching stage (also known as the retrieval step) identifies a small fraction of relevant items from billion-scale item corpus in low latency and computational cost. Item-to-item collaborative filtering (item-based CF) and embeddingbased retrieval (EBR) have been long used in the industrial matching stage owing to its efficiency. However, item-based CF is hard to meet personalization, while EBR has difficulty in satisfying diversity. In this paper, we propose a novel matching architecture, Path-based Deep Network (named PDN), through incorporating both personalization and diversity to enhance matching performance. Specifically, PDN is comprised of two modules: Trigger Net and Similarity Net. PDN utilizes Trigger Net to capture the user's interest in each of his/her interacted item. Similarity Net is devised to evaluate the similarity between each interacted item and the target item based on these items' profile and CF information. The final relevance between the user and the target item is calculated by explicitly considering user's diverse interests, i.e., aggregating the relevance weights of the related two-hop paths (one hop of a path corresponds to user-item interaction and the other to item-item relevance). Furthermore, we describe the architecture design of the proposed PDN in a leading real-world E-Commerce service (Mobile Taobao App). Based on offline evaluations and online A/B test, we show that PDN outperforms the existing solutions for the same task. The online results also demonstrate that PDN can retrieve more personalized and more diverse items to significantly improve user engagement. Currently, PDN system has been successfully deployed at Mobile Taobao App and handling major online traffic.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext d5adaa0f-0b7b-4582-a380-4eaf80ae8298Cited by top-tier papers3
- Diffusion-based Multi-modal Synergy Interest Network for Click-through Rate PredictionXiaoxi Cui, Weihai Lu, Yu Tong, Yiheng Li et al.SIGIR 2025 · 15 citations
- Personalized Retrieval over Millions of ItemsHemanth Vemuri, Sheshansh Agrawal, Shivam Mittal, Deepak Saini et al.SIGIR 2023 · 6 citations
- Lower Bias, Higher Welfare: How Creator Competition Reshapes Bias-Variance Tradeoff in Recommendation Platforms?Kang Wang, Renzhe Xu, Bo LiKDD 2026
Builds on1
Related papers
- Deep Interest Highlight Network for Click-Through Rate Prediction in Trigger-Induced RecommendationQijie Shen, Hong Wen, Wanjie Tao, Jing Zhang et al.WWW 2022 · 58 citations
- Who to Watch Next: Two-side Interactive Networks for Live Broadcast RecommendationJiarui Jin, Xianyu Chen, Yuanbo Chen, Weinan Zhang et al.WWW 2022 · 1 citation
- Learning Unified Embeddings for Recommendation via Meta-path SemanticsQianxiu Hao, Qianqian Xu, Zhiyong Yang, Qingming HuangACM MM 2021 · 4 citations
- Deep Match to Rank Model for Personalized Click-Through Rate PredictionZequn Lyu, Yu Dong, Chengfu Huo, Weijun RenAAAI 2020 · 73 citations
- Towards Faster Deep Collaborative Filtering via Hierarchical Decision NetworksYu Chen, Sinno Jialin PanAAAI 2021 · 3 citations
