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

推荐系统中转化率预测的多层深度级联树

Multi-Level Deep Cascade Trees for Conversion Rate Prediction in Recommendation System

Alibaba Group(阿里巴巴集团);Hangzhou Dianzi University(杭州电子科技大学);University of Technology Sydney(悉尼科技大学)

Hong Wen, Jing Zhang, Quan Lin, Keping Yang, Pipei Huang

摘要:

开发有效和高效的推荐方法对于现代电子商务平台来说非常具有挑战性。一般来说,点击率预测(\textit{CTR})和转化率预测(\textit{CVR})是两个基本的模块,其中\textit{CVR}模块是直接影响最终购买量的关键因素。然而,由于其稀疏性,它确实非常具有挑战性。在本文中,我们解决了这个问题,提出了多级深级联树(\textit{ldcTree}),这是一种新的决策树集成方法。它通过堆叠梯度提升决策树(\textit{GBDT})来利用深度级联结构,以有效地学习特征表示。此外,我们提出利用前一级\textit{GBDT}的每棵树中的交叉熵作为下一级\textit{GBDT}的输入特征表示,这具有清楚的解释,即,在下一级\textit{GBDT}中从根到叶节点的遍历对应于在前\textit{GBDT}中的某些遍历的组合。深度级联结构和组合规则使所提出的\textit{ldcTree}具有更强的分布式特征表示能力。此外,受集成学习的启发,我们提出了一个增强的\textit{ldcTree}(\textit{E-ldcTree}),以鼓励模型的多样性,并进一步提高表示能力。最后,我们提出了一种改进的基于\textit{EldcTree}的特征学习方法(\textit{F-EldcTree}),以充分利用预训练\textit{GBDT}模型识别的弱相关性和强相关性特征。离线数据集和在线部署的实验结果证明了所提方法的有效性。

英文摘要:

Developing effective and efficient recommendation methods is very challenging for modern e-commerce platforms. Generally speaking, two essential modules named "Click-Through Rate Prediction" (\textit{CTR}) and "Conversion Rate Prediction" (\textit{CVR}) are included, where \textit{CVR} module is a crucial factor that affects the final purchasing volume directly. However, it is indeed very challenging due to its sparseness nature. In this paper, we tackle this problem by proposing multi-Level Deep Cascade Trees (\textit{ldcTree}), which is a novel decision tree ensemble approach. It leverages deep cascade structures by stacking Gradient Boosting Decision Trees (\textit{GBDT}) to effectively learn feature representation. In addition, we propose to utilize the cross-entropy in each tree of the preceding \textit{GBDT} as the input feature representation for next level \textit{GBDT}, which has a clear explanation, i.e., a traversal from root to leaf nodes in the next level \textit{GBDT} corresponds to the combination of certain traversals in the preceding \textit{GBDT}. The deep cascade structure and the combination rule enable the proposed \textit{ldcTree} to have a stronger distributed feature representation ability. Moreover, inspired by ensemble learning, we propose an Ensemble \textit{ldcTree} (\textit{E-ldcTree}) to encourage the model's diversity and enhance the representation ability further. Finally, we propose an improved Feature learning method based on \textit{EldcTree} (\textit{F-EldcTree}) for taking adequate use of weak and strong correlation features identified by pre-trained \textit{GBDT} models. Experimental results on off-line data set and online deployment demonstrate the effectiveness of the proposed methods.

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

↑