基于多特征多兴趣的CTR预测多任务学习模型

Yufeng Xie, Mingchu Li, Kun Lu, Syed Bilal Hussain Shah, Xiao Zheng
{"title":"基于多特征多兴趣的CTR预测多任务学习模型","authors":"Yufeng Xie, Mingchu Li, Kun Lu, Syed Bilal Hussain Shah, Xiao Zheng","doi":"10.1109/DSC54232.2022.9888898","DOIUrl":null,"url":null,"abstract":"In the era of big data, the acquisition and utilization of information becomes difficult with the skyrocketing amount of data. It is often difficult for ordinary users to find the in-formation or items they need, and personalized recommendation systems can solve this problem well. Currently, recommendation systems increasingly adopt models based on deep learning. The most critical issue in using deep learning for recommendation systems is how to use neural networks to accurately learn user representation vectors and item representation vectors. Many deep learning models used a single vector to represent users, but users' interests were often diverse. Therefore, some researchers consider using multiple vectors to represent user interests, and each interest vector corresponds to a category of items. This method sounds more scientific. However, these models still have problems. Their interpretation of user interests stays at the item level, and does not go deep into the item feature level. In order to solve this problem, we consider user interests from the perspective of item characteristics, and propose 3M (Multi-task, Multi-interest, Multi-feature) model. The 3M model trains multiple interest vectors for each user and extracts multiple characteristic vectors for each item at the same time, then uses a multi-task learning model to connect the characteristic vectors with the interest vectors and train them to obtain multiple interest scores. According to the multiple interest scores, the user click probability can be obtained. Experiments show that our model performs significantly better than the classic CTR(Click - Through Rate) prediction model on the experimental dataset.","PeriodicalId":368903,"journal":{"name":"2022 IEEE Conference on Dependable and Secure Computing (DSC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Multi-task Learning Model based on Multiple Characteristics and Multiple Interests for CTR prediction\",\"authors\":\"Yufeng Xie, Mingchu Li, Kun Lu, Syed Bilal Hussain Shah, Xiao Zheng\",\"doi\":\"10.1109/DSC54232.2022.9888898\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the era of big data, the acquisition and utilization of information becomes difficult with the skyrocketing amount of data. It is often difficult for ordinary users to find the in-formation or items they need, and personalized recommendation systems can solve this problem well. Currently, recommendation systems increasingly adopt models based on deep learning. The most critical issue in using deep learning for recommendation systems is how to use neural networks to accurately learn user representation vectors and item representation vectors. Many deep learning models used a single vector to represent users, but users' interests were often diverse. Therefore, some researchers consider using multiple vectors to represent user interests, and each interest vector corresponds to a category of items. This method sounds more scientific. However, these models still have problems. Their interpretation of user interests stays at the item level, and does not go deep into the item feature level. In order to solve this problem, we consider user interests from the perspective of item characteristics, and propose 3M (Multi-task, Multi-interest, Multi-feature) model. The 3M model trains multiple interest vectors for each user and extracts multiple characteristic vectors for each item at the same time, then uses a multi-task learning model to connect the characteristic vectors with the interest vectors and train them to obtain multiple interest scores. According to the multiple interest scores, the user click probability can be obtained. Experiments show that our model performs significantly better than the classic CTR(Click - Through Rate) prediction model on the experimental dataset.\",\"PeriodicalId\":368903,\"journal\":{\"name\":\"2022 IEEE Conference on Dependable and Secure Computing (DSC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE Conference on Dependable and Secure Computing (DSC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DSC54232.2022.9888898\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Conference on Dependable and Secure Computing (DSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DSC54232.2022.9888898","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在大数据时代,随着数据量的激增,信息的获取和利用变得非常困难。普通用户往往很难找到自己需要的信息或物品,个性化推荐系统可以很好地解决这个问题。目前,推荐系统越来越多地采用基于深度学习的模型。在推荐系统中使用深度学习最关键的问题是如何使用神经网络准确地学习用户表示向量和项目表示向量。许多深度学习模型使用单一向量来表示用户,但用户的兴趣往往是多种多样的。因此,一些研究者考虑使用多个向量来表示用户兴趣,每个兴趣向量对应一个类别的物品。这种方法听起来更科学。然而,这些模型仍然存在问题。他们对用户兴趣的解释停留在道具层面,而没有深入到道具功能层面。为了解决这一问题,我们从物品特征的角度考虑用户兴趣,提出了3M (Multi-task, Multi-interest, Multi-feature)模型。3M模型为每个用户训练多个兴趣向量,同时提取每个项目的多个特征向量,然后使用多任务学习模型将特征向量与兴趣向量连接并训练得到多个兴趣分数。根据多个兴趣分数,可以得到用户的点击概率。实验表明,我们的模型在实验数据集上的表现明显优于经典的CTR(点击率)预测模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-task Learning Model based on Multiple Characteristics and Multiple Interests for CTR prediction
In the era of big data, the acquisition and utilization of information becomes difficult with the skyrocketing amount of data. It is often difficult for ordinary users to find the in-formation or items they need, and personalized recommendation systems can solve this problem well. Currently, recommendation systems increasingly adopt models based on deep learning. The most critical issue in using deep learning for recommendation systems is how to use neural networks to accurately learn user representation vectors and item representation vectors. Many deep learning models used a single vector to represent users, but users' interests were often diverse. Therefore, some researchers consider using multiple vectors to represent user interests, and each interest vector corresponds to a category of items. This method sounds more scientific. However, these models still have problems. Their interpretation of user interests stays at the item level, and does not go deep into the item feature level. In order to solve this problem, we consider user interests from the perspective of item characteristics, and propose 3M (Multi-task, Multi-interest, Multi-feature) model. The 3M model trains multiple interest vectors for each user and extracts multiple characteristic vectors for each item at the same time, then uses a multi-task learning model to connect the characteristic vectors with the interest vectors and train them to obtain multiple interest scores. According to the multiple interest scores, the user click probability can be obtained. Experiments show that our model performs significantly better than the classic CTR(Click - Through Rate) prediction model on the experimental dataset.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信