Who to Watch Next: Two-side Interactive Networks for Live Broadcast Recommendation
Jiarui Jin, Xianyu Chen, Yuanbo Chen, Weinan Zhang, Renting Rui, Zaifan Jiang, Zhewen Su, Yong Yu
Abstract
With the prevalence of live broadcast business nowadays, a new type of recommendation service, called live broadcast recommendation, is widely used in many mobile e-commerce Apps. Different from classical item recommendation, live broadcast recommendation is to automatically recommend user anchors instead of items considering the interactions among triple-objects (i.e., users, anchors, items) rather than binary interactions between users and items. Existing methods based on binary objects, ranging from early matrix factorization to recently emerged deep learning, obtain objects’ embeddings by mapping from pre-existing features. Directly applying these techniques would lead to limited performance, as they are failing to encode collaborative signals among triple-objects. In this paper, we propose a novel TWo-side Interactive NetworkS (TWINS) for live broadcast recommendation. In order to fully use both static and dynamic information on user and anchor sides, we combine a product-based neural network with a recurrent neural network to learn the embedding of each object. In addition, instead of directly measuring the similarity, TWINS effectively injects the collaborative effects into the embedding process in an explicit manner by modeling interactive patterns between the user’s browsing history and the anchor’s broadcast history in both item and anchor aspects. Furthermore, we design a novel co-retrieval technique to select key items among massive historic records efficiently. Offline experiments on real large-scale data show the superior performance of the proposed TWINS, compared to representative methods; and further results of online experiments on Diantao App show that TWINS gains average performance improvement of around 8% on ACTR metric, 3% on UCTR metric, 3.5% on UCVR metric.
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 018057cf-9fe0-4b61-b5d4-4904a071793aBuilds on2
- An Efficient Neighborhood-based Interaction Model for Recommendation on Heterogeneous GraphJiarui Jin, Jiarui Qin, Yuchen Fang, Kounianhua Du et al.KDD 2020 · 115 citations
- Dual Side Deep Context-aware Modulation for Social RecommendationBairan Fu, Wenming Zhang, Guangneng Hu, Xinyu Dai et al.WWW 2021 · 55 citations
Related papers
- Who You Would Like to Share With? A Study of Share Recommendation in Social E-commerceHouye Ji, Junxiong Zhu, Xiao Wang, Chuan Shi et al.AAAI 2021 · 43 citations
- Path-based Deep Network for Candidate Item Matching in RecommendersHouyi Li, Zhihong Chen, Chenliang Li, Rong Xiao et al.SIGIR 2021 · 13 citations
- FINN: Feedback Interactive Neural Network for Intent RecommendationYatao Yang, Biyu Ma, Jun Tan, Hongbo Deng et al.WWW 2021 · 9 citations
- Room Matters: Dynamic Room-level Collaboration Information Modeling for Live Streaming RecommendationKe Guo, Changle Qu, Xiao Zhang, Liqin Zhao et al.WWW 2026
- Retracing and Restoring: Chronological Context Preservation for Effective Dynamic RecommendationMin-Jeong Kim, Jiwon Son, Yeon-Chang Lee, Sang-Wook KimWWW 2026
