arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2302.08128cs.IRcs.AI
收藏

基于邻域的视频排序模型中长尾排序问题的改进

Neighbor Based Enhancement for the Long-Tail Ranking Problem in Video Rank Models

Tencent Inc(腾讯公司);Beijing Institute of Technology(北京理工大学)

Xuanji Xiao, Ziyu He

摘要:

排名模型在工业推荐系统、广告和搜索引擎中起着关键作用。现有的工作利用语义标签和用户-项目交互行为,例如,点击次数、浏览次数等,以预测用户兴趣和项隐藏表示,用于估计用户项偏好得分。然而,这些基于行为标签的模型遇到了很大的挑战和有效性降低时,用户-项目的交互活动是不够的,我们称之为“长尾排名问题”。现有的排名模型忽略了这个问题,但它很常见,也很重要,因为任何用户或项目一旦在短时间内不持续活跃,就可能是长尾的。在本文中,我们提出了一种新的邻居增强结构,以帮助训练的目标用户或项目的表示。它利用了相似的邻居(静态或动态相似性),并通过多级注意力操作来平衡不同邻居的权重。在著名的公共数据集MovieLens 1 M上的实验证明了该方法在基于行为标签的基线模型上的效率,在长尾用户数据集上的绝对CTR AUC增益为0.0259。

英文摘要:

Rank models play a key role in industrial recommender systems, advertising, and search engines. Existing works utilize semantic tags and user-item interaction behaviors, e.g., clicks, views, etc., to predict the user interest and the item hidden representation for estimating the user-item preference score. However, these behavior-tag-based models encounter great challenges and reduced effectiveness when user-item interaction activities are insufficient, which we called "the long-tail ranking problem". Existing rank models ignore this problem, but its common and important because any user or item can be long-tailed once they are not consistently active for a short period. In this paper, we propose a novel neighbor enhancement structure to help train the representation of the target user or item. It takes advantage of similar neighbors (static or dynamic similarity) with multi-level attention operations balancing the weights of different neighbors. Experiments on the well-known public dataset MovieLens 1M demonstrate the efficiency of the method over the baseline behavior-tag-based model with an absolute CTR AUC gain of 0.0259 on the long-tail user dataset.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑