Real-time Attention Based Look-alike Model for Recommender System
Not on the map. Why?
Abstract (arXiv)
Recently, deep learning models play more and more important roles in contents recommender systems. However, although the performance of recommendations is greatly improved, the "Matthew effect" becomes increasingly evident. While the head contents get more and more popular, many competitive long-tail contents are difficult to achieve timely exposure because of lacking behavior features. This issue has badly impacted the quality and diversity of recommendations. To solve this problem, look-alike algorithm is a good choice to extend audience for high quality long-tail contents. But the traditional look-alike models which widely used in online advertising are not suitable for recommender systems because of the strict requirement of both real-time and effectiveness. This paper introduces a real-time attention based look-alike model (RALM) for recommender systems, which tackles the challenge of conflict between real-time and effectiveness. RALM realizes real-time look-alike audience extension benefiting from seeds-to-user similarity prediction and improves the effectiveness through optimizing user representation learning and look-alike learning modeling. For user representation learning, we propose a novel neural network structure named attention merge layer to replace the concatenation layer, which significantly improves the expressive ability of multi-fields feature learning. On the other hand, considering the various members of seeds, we design global attention unit and local attention unit to learn robust and adaptive seeds representation with respect to a certain target user. At last, we introduce seeds clustering mechanism which not only reduces the time complexity of attention units prediction but also minimizes the loss of seeds information at the same time. According to our experiments, RALM shows superior effectiveness and performance than popular look-alike models.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Jun 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 2; 2024: 1; 2025: 1; 2026: 1.
6 papers.
- 2023Towards Explainable Collaborative Filtering with Taste Clusters Learningcited by 2
- 2024Flexible Generation of Preference Data for Recommendation Analysiscited by 2
- 2025AdaF^2M^2: Comprehensive Learning and Responsive Leveraging Features in Recommendation Systemcited by 1
- 2022Causal Intervention for Fairness in Multi-behavior Recommendationcited by 0
- 2023Reframing Audience Expansion through the Lens of Probability Density Estimationcited by 0
- 2026From "Who Is This User?" to "What Does This Purchase Mean?": A Deployed Pipeline for Semantic User Profiling at Bank Scalecited by 0
- 2026From "Who Is This User?" to "What Does This Purchase Mean?": A Deployed Pipeline for Semantic User Profiling at Bank Scale17 Sep 2026
- 2025AdaF^2M^2: Comprehensive Learning and Responsive Leveraging Features in Recommendation System27 Jan 2025
- 2024Flexible Generation of Preference Data for Recommendation Analysis23 Jul 2024
- 2023Reframing Audience Expansion through the Lens of Probability Density Estimation10 Nov 2023
- 2023Towards Explainable Collaborative Filtering with Taste Clusters Learning27 Apr 2023
- 2022Causal Intervention for Fairness in Multi-behavior Recommendation10 Sep 2022