arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.06312cs.IR
收藏

一种用于CTR预测的深度用户兴趣模型的非序贯方法

A Non-sequential Approach to Deep User Interest Model for CTR Prediction

Keke Zhao, Xing Zhao, Qi Cao, Linjian Mo

摘要:

点击率预测在许多工业应用中起着重要的作用,近年来,利用注意力机制从历史行为中捕捉用户兴趣的深度兴趣模型受到了广泛关注。然而,目前大多数模型都是基于序列模型的,这些模型将行为序列截短固定长度,从而难以处理很长的行为序列。另一个大问题是,相同长度的序列在时间上可能完全不同,具有完全不同的含义。在本文中,我们提出了一个非顺序的方法来解决上述问题。具体来说,我们首先以稀疏键向量格式表示行为数据,其中向量包含丰富的行为信息,如时间,计数和类别。接下来,我们增强了深度兴趣网络,通过一个新的注意力网络来考虑这些丰富的信息。稀疏表示使得处理大规模的长行为序列成为可能。最后,我们引入了一个多维划分框架来挖掘行为交互。该框架可以将数据划分到定制设计的时间桶中,以捕获在不同时间桶中聚合的信息之间的交互。同样,它也可以将数据划分为不同的类别,并捕获它们之间的交互。实验在两个公共数据集上进行:一个是广告数据集,另一个是生产推荐数据集。我们的模型在这两个数据集上都优于其他最先进的模型。

英文摘要:

Click-Through Rate (CTR) prediction plays an important role in many industrial applications, and recently a lot of attention is paid to the deep interest models which use attention mechanism to capture user interests from historical behaviors. However, most current models are based on sequential models which truncate the behavior sequences by a fixed length, thus have difficulties in handling very long behavior sequences. Another big problem is that sequences with the same length can be quite different in terms of time, carrying completely different meanings. In this paper, we propose a non-sequential approach to tackle the above problems. Specifically, we first represent the behavior data in a sparse key-vector format, where the vector contains rich behavior info such as time, count and category. Next, we enhance the Deep Interest Network to take such rich information into account by a novel attention network. The sparse representation makes it practical to handle large scale long behavior sequences. Finally, we introduce a multidimensional partition framework to mine behavior interactions. The framework can partition data into custom designed time buckets to capture the interactions among information aggregated in different time buckets. Similarly, it can also partition the data into different categories and capture the interactions among them. Experiments are conducted on two public datasets: one is an advertising dataset and the other is a production recommender dataset. Our models outperform other state-of-the-art models on both datasets.

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

↑