基于图网络和特征挤压-激发机制的点击率预测模型

IF 2.5 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS International Journal of Web Information Systems Pub Date : 2024-07-09 DOI:10.1108/ijwis-07-2023-0110
Zhongqin Bi, Susu Sun, Weina Zhang, Meijing Shan
{"title":"基于图网络和特征挤压-激发机制的点击率预测模型","authors":"Zhongqin Bi, Susu Sun, Weina Zhang, Meijing Shan","doi":"10.1108/ijwis-07-2023-0110","DOIUrl":null,"url":null,"abstract":"\nPurpose\nPredicting a user’s click-through rate on an advertisement or item often uses deep learning methods to mine hidden information in data features, which can provide users with more accurate personalized recommendations. However, existing works usually ignore the problem that the drift of user interests may lead to the generation of new features when they compute feature interactions. Based on this, this paper aims to design a model to address this issue.\n\n\nDesign/methodology/approach\nFirst, the authors use graph neural networks to model users’ interest relationships, using the existing user features as the node features of the graph neural networks. Second, through the squeeze-and-excitation network mechanism, the user features and item features are subjected to squeeze operation and excitation operation, respectively, and the importance of the features is adaptively adjusted by learning the channel weights of the features. Finally, the feature space is divided into multiple subspaces to allocate features to different models, which can improve the performance of the model.\n\n\nFindings\nThe authors conduct experiments on two real-world data sets, and the results show that the model can effectively improve the prediction accuracy of advertisement or item click events.\n\n\nOriginality/value\nIn the study, the authors propose graph network and feature squeeze-and-excitation model for click-through rate prediction, which is used to dynamically learn the importance of features. The results indicate the effectiveness of the model.\n","PeriodicalId":44153,"journal":{"name":"International Journal of Web Information Systems","volume":null,"pages":null},"PeriodicalIF":2.5000,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Click-through rate prediction model based on graph networks and feature squeeze-and-excitation mechanism\",\"authors\":\"Zhongqin Bi, Susu Sun, Weina Zhang, Meijing Shan\",\"doi\":\"10.1108/ijwis-07-2023-0110\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\nPurpose\\nPredicting a user’s click-through rate on an advertisement or item often uses deep learning methods to mine hidden information in data features, which can provide users with more accurate personalized recommendations. However, existing works usually ignore the problem that the drift of user interests may lead to the generation of new features when they compute feature interactions. Based on this, this paper aims to design a model to address this issue.\\n\\n\\nDesign/methodology/approach\\nFirst, the authors use graph neural networks to model users’ interest relationships, using the existing user features as the node features of the graph neural networks. Second, through the squeeze-and-excitation network mechanism, the user features and item features are subjected to squeeze operation and excitation operation, respectively, and the importance of the features is adaptively adjusted by learning the channel weights of the features. Finally, the feature space is divided into multiple subspaces to allocate features to different models, which can improve the performance of the model.\\n\\n\\nFindings\\nThe authors conduct experiments on two real-world data sets, and the results show that the model can effectively improve the prediction accuracy of advertisement or item click events.\\n\\n\\nOriginality/value\\nIn the study, the authors propose graph network and feature squeeze-and-excitation model for click-through rate prediction, which is used to dynamically learn the importance of features. The results indicate the effectiveness of the model.\\n\",\"PeriodicalId\":44153,\"journal\":{\"name\":\"International Journal of Web Information Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.5000,\"publicationDate\":\"2024-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Web Information Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1108/ijwis-07-2023-0110\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Web Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1108/ijwis-07-2023-0110","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

目的预测用户对广告或商品的点击率通常使用深度学习方法挖掘数据特征中的隐藏信息,从而为用户提供更准确的个性化推荐。然而,现有研究在计算特征交互时通常会忽略用户兴趣的漂移可能导致产生新特征的问题。基于此,本文旨在设计一种模型来解决这一问题。设计/方法/途径首先,作者利用图神经网络对用户的兴趣关系进行建模,将已有的用户特征作为图神经网络的节点特征。其次,通过挤压-激励网络机制,对用户特征和项目特征分别进行挤压运算和激励运算,并通过学习特征的通道权重来自适应地调整特征的重要性。最后,将特征空间划分为多个子空间,将特征分配给不同的模型,这样可以提高模型的性能。研究结果作者在两个真实世界的数据集上进行了实验,结果表明该模型可以有效提高广告或项目点击事件的预测精度。原创性/价值在这项研究中,作者提出了用于点击率预测的图网络和特征挤压-激励模型,该模型用于动态学习特征的重要性。研究结果表明了该模型的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Click-through rate prediction model based on graph networks and feature squeeze-and-excitation mechanism
Purpose Predicting a user’s click-through rate on an advertisement or item often uses deep learning methods to mine hidden information in data features, which can provide users with more accurate personalized recommendations. However, existing works usually ignore the problem that the drift of user interests may lead to the generation of new features when they compute feature interactions. Based on this, this paper aims to design a model to address this issue. Design/methodology/approach First, the authors use graph neural networks to model users’ interest relationships, using the existing user features as the node features of the graph neural networks. Second, through the squeeze-and-excitation network mechanism, the user features and item features are subjected to squeeze operation and excitation operation, respectively, and the importance of the features is adaptively adjusted by learning the channel weights of the features. Finally, the feature space is divided into multiple subspaces to allocate features to different models, which can improve the performance of the model. Findings The authors conduct experiments on two real-world data sets, and the results show that the model can effectively improve the prediction accuracy of advertisement or item click events. Originality/value In the study, the authors propose graph network and feature squeeze-and-excitation model for click-through rate prediction, which is used to dynamically learn the importance of features. The results indicate the effectiveness of the model.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Web Information Systems
International Journal of Web Information Systems COMPUTER SCIENCE, INFORMATION SYSTEMS-
CiteScore
4.60
自引率
0.00%
发文量
19
期刊介绍: The Global Information Infrastructure is a daily reality. In spite of the many applications in all domains of our societies: e-business, e-commerce, e-learning, e-science, and e-government, for instance, and in spite of the tremendous advances by engineers and scientists, the seamless development of Web information systems and services remains a major challenge. The journal examines how current shared vision for the future is one of semantically-rich information and service oriented architecture for global information systems. This vision is at the convergence of progress in technologies such as XML, Web services, RDF, OWL, of multimedia, multimodal, and multilingual information retrieval, and of distributed, mobile and ubiquitous computing. Topicality While the International Journal of Web Information Systems covers a broad range of topics, the journal welcomes papers that provide a perspective on all aspects of Web information systems: Web semantics and Web dynamics, Web mining and searching, Web databases and Web data integration, Web-based commerce and e-business, Web collaboration and distributed computing, Internet computing and networks, performance of Web applications, and Web multimedia services and Web-based education.
期刊最新文献
Web-aided data set expansion in deep learning: evaluating trainable activation functions in ResNet for improved image classification Click-through rate prediction model based on graph networks and feature squeeze-and-excitation mechanism Enhancing the viewing, browsing and searching of knowledge graphs with virtual properties GethReplayer: a smart contract testing method based on transaction replay Large language models for automated Q&A involving legal documents: a survey on algorithms, frameworks and applications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1