CADCN:一种基于特征重要性的点击率预测模型

Qi Wang, Yicheng Di, Yuan Liu
{"title":"CADCN:一种基于特征重要性的点击率预测模型","authors":"Qi Wang, Yicheng Di, Yuan Liu","doi":"10.1145/3603781.3603822","DOIUrl":null,"url":null,"abstract":"Recommendation systems are widely used in real-world advertising recommendations. In traditional recommendation system prediction models, click-through rate plays a crucial role. However, traditional recommendation systems cross-combine original features to make the linear model memorable and generalizable while taking into account the importance of features requires a lot of computational cost, and it uses manual cross-combination of features on data, which requires a lot of time and effort. Traditional recommendation systems simply learn the relationship between features without considering the importance of features. We combine deep crossover network and AFM network, dynamically assign weights to different features prior to feature crossover using a synthetic incentive network, and introduce attention mechanism based on feature crossover explicitly. We then propose an advertisement click-through rate prediction based on feature importance model, and the experimental results demonstrate that the algorithm is superior to the deep crossover network in predicting the click-through rate of advertisements.","PeriodicalId":391180,"journal":{"name":"Proceedings of the 2023 4th International Conference on Computing, Networks and Internet of Things","volume":"123 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"CADCN: A click-through rate prediction model based on feature importance\",\"authors\":\"Qi Wang, Yicheng Di, Yuan Liu\",\"doi\":\"10.1145/3603781.3603822\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recommendation systems are widely used in real-world advertising recommendations. In traditional recommendation system prediction models, click-through rate plays a crucial role. However, traditional recommendation systems cross-combine original features to make the linear model memorable and generalizable while taking into account the importance of features requires a lot of computational cost, and it uses manual cross-combination of features on data, which requires a lot of time and effort. Traditional recommendation systems simply learn the relationship between features without considering the importance of features. We combine deep crossover network and AFM network, dynamically assign weights to different features prior to feature crossover using a synthetic incentive network, and introduce attention mechanism based on feature crossover explicitly. We then propose an advertisement click-through rate prediction based on feature importance model, and the experimental results demonstrate that the algorithm is superior to the deep crossover network in predicting the click-through rate of advertisements.\",\"PeriodicalId\":391180,\"journal\":{\"name\":\"Proceedings of the 2023 4th International Conference on Computing, Networks and Internet of Things\",\"volume\":\"123 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2023 4th International Conference on Computing, Networks and Internet of Things\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3603781.3603822\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2023 4th International Conference on Computing, Networks and Internet of Things","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3603781.3603822","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

推荐系统广泛应用于现实世界的广告推荐。在传统的推荐系统预测模型中,点击率起着至关重要的作用。然而,传统的推荐系统在考虑特征重要性的同时,对原始特征进行交叉组合,使线性模型具有可记忆性和泛化性,这需要大量的计算成本,并且在数据上使用人工交叉组合特征,这需要大量的时间和精力。传统的推荐系统只是简单地学习特征之间的关系,而没有考虑特征的重要性。我们将深度交叉网络与AFM网络相结合,在特征交叉之前使用综合激励网络动态分配不同特征的权重,并明确引入基于特征交叉的注意机制。然后,我们提出了一种基于特征重要性模型的广告点击率预测算法,实验结果表明,该算法在预测广告点击率方面优于深度交叉网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
CADCN: A click-through rate prediction model based on feature importance
Recommendation systems are widely used in real-world advertising recommendations. In traditional recommendation system prediction models, click-through rate plays a crucial role. However, traditional recommendation systems cross-combine original features to make the linear model memorable and generalizable while taking into account the importance of features requires a lot of computational cost, and it uses manual cross-combination of features on data, which requires a lot of time and effort. Traditional recommendation systems simply learn the relationship between features without considering the importance of features. We combine deep crossover network and AFM network, dynamically assign weights to different features prior to feature crossover using a synthetic incentive network, and introduce attention mechanism based on feature crossover explicitly. We then propose an advertisement click-through rate prediction based on feature importance model, and the experimental results demonstrate that the algorithm is superior to the deep crossover network in predicting the click-through rate of advertisements.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信