{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T15:52:28Z","timestamp":1774453948381,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T00:00:00Z","timestamp":1675123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T00:00:00Z","timestamp":1675123200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The purpose of click-through rate (CTR) prediction is to anticipate how likely a person is to click on an advertisement or item. It's required for a lot of internet applications, such online advertising and recommendation systems. The previous click-through rate estimation approach suffered from the following two flaws. On the one hand, input characteristics (such as user id, user age, user age, item id, item category) are usually sparse and multidimensional, making them effective. High-level combination characteristics are used for prediction. Obtaining it manually by domain experts takes a long time and is difficult to finish; also, customer interests are not all the same. The accuracy of the model findings will significantly increase if this immediately recognized component is incorporated in the prediction model. As a consequence, this study creates an IARM (interactive attention rate estimation model) that incorporates user interest as well as a multi-head self-attention mechanism. The deep learning network is used in the model to determine the user's interest expression based on user attributes. The multi-head self-attention mechanism with residual network is then employed to get feature interaction, which enhances the degree of effect of significant characteristics on the estimation result as well as its accuracy. The IARM model outperforms other recent prediction models in the assessment metrics AUC and LOSS, and it has superior accuracy, according to the results from the public experimental data set.<\/jats:p>","DOI":"10.1186\/s40537-023-00688-6","type":"journal-article","created":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T16:03:57Z","timestamp":1675181037000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Click-through rate prediction model integrating user interest and multi-head attention mechanism"],"prefix":"10.1186","volume":"10","author":[{"given":"Wei","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yahui","family":"Han","sequence":"additional","affiliation":[]},{"given":"Baolin","family":"Yi","sequence":"additional","affiliation":[]},{"given":"Zhaoli","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,31]]},"reference":[{"key":"688_CR1","unstructured":"Deep Session Interest Network for Click-Through Rate Prediction. arXiv:1905.06482v1 [cs.IR] 16 May 2019."},{"key":"688_CR2","unstructured":"AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networks. arXiv:1810.11921v2 [cs.IR] 23 Aug 2019."},{"key":"688_CR3","doi-asserted-by":"crossref","unstructured":"Wang R, Shivanna R, Cheng D Z, et al. DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systems. 2020.","DOI":"10.1145\/3442381.3450078"},{"key":"688_CR4","unstructured":"Yi T, Dehghani M, Bahri D, et al. Efficient Transformers: A Survey. 2020."},{"key":"688_CR5","first-page":"1","volume":"99","author":"X Shen","year":"2019","unstructured":"Shen X, Yi B, Liu H, et al. Deep variational matrix factorization with knowledge embedding for recommendation system. IEEE Trans Knowl Data Eng. 2019;99:1\u20131.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"688_CR6","unstructured":"Vaswani A, Shazeer N, Parmar N, Uszkoreit J, Jones L, Gomez AN, Kaiser L, Polosukhin I. Attention is all you need. 2017."},{"key":"688_CR7","unstructured":"Feature Generation by Convolutional Neural Network for Click-Through Rate Prediction. arXiv:1904.04447v1 [cs.IR] 9 Apr 2019."},{"key":"688_CR8","unstructured":"Ioffe S, Szegedy C. Batch normalization: accelerating deep network training by reducing internal covariate shift. arXiv preprint arXiv:1502.03167; 2015."},{"key":"688_CR9","unstructured":"Deep & Cross Network for Ad Click Predictions. arXiv:1708.05123 [cs.LG] 17 Aug 2017."},{"key":"688_CR10","unstructured":"Operation-aware Neural Networks for User Response Prediction. arXiv:1904.12579v1 [cs.IR] 2 Apr 2019."},{"key":"688_CR11","doi-asserted-by":"crossref","unstructured":"Jianfang W, Xilin W, Xu Y, Qiuling Z. Deviation-based graph attention neural network recommendation algorithm. Control Decis 2021; 1\u20139.","DOI":"10.1109\/IJCNN52387.2021.9534339"},{"key":"688_CR12","unstructured":"Wide & Deep Learning for Recommender Systems. arXiv:1606.07792v1 [cs.LG] 24 Jun 2016."},{"key":"688_CR13","unstructured":"LLC, Lee DL, Liu Z, et al. Multi-interest network with dynamic routing for recommendation at Tmall. ACM. 2019."},{"issue":"05","key":"688_CR14","first-page":"219","volume":"30","author":"Z Jianing","year":"2021","unstructured":"Jianing Z, Jingsheng L, Xuexue Z. Graph network social recommendation algorithm based on agru-gnn. Comput Syst Appl. 2021;30(05):219\u201327.","journal-title":"Comput Syst Appl"},{"key":"688_CR15","doi-asserted-by":"crossref","unstructured":"Zou H, Zheng M. Random node recommend algorithm for influence maximization in social network[C]\/\/2018 9th International Conference on Information Technology in Medicine and Education (ITME). IEEE Computer Society, 2018.","DOI":"10.1109\/ITME.2018.00205"},{"key":"688_CR16","unstructured":"Shan Y, Ryan Hoens T, Jian Jiao, Haijing Wang, Dong Yu, and JC Mao. Deep crossing: Web-scale modeling without manually crafted combinatorial features. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 255\u2013262."},{"key":"688_CR17","unstructured":"Pande H. Field-embedded factorization machines for click-through rate prediction. 2020."},{"key":"688_CR18","doi-asserted-by":"crossref","unstructured":"Qu Y, Han C, Kan R, et al. Product-based neural networks for user response prediction[C]\/\/2016 IEEE 16th International Conference on Data Mining (ICDM). IEEE, 2016.","DOI":"10.1109\/ICDM.2016.0151"},{"key":"688_CR19","unstructured":"xDeepFM: Combining explicit and implicit feature interactions for recommender systems. arXiv:1803.05170v3 [cs.LG] 30 May 2018."},{"key":"688_CR20","doi-asserted-by":"crossref","unstructured":"Xiao J, Ye H, He X, et al. Attentional factorization machines: learning the weight of feature interactions via attention networks. 2017.","DOI":"10.24963\/ijcai.2017\/435"},{"issue":"12","key":"688_CR21","first-page":"3418","volume":"51","author":"Yu Kuifeng","year":"2020","unstructured":"Kuifeng Yu, Guihua D, Xiang S. College entrance examination volunteer recommendation algorithm based on multi-feature weight fuzzy clustering. J Central South Univ (Nat Sci Edn). 2020;51(12):3418\u201329.","journal-title":"J Central South Univ (Nat Sci Edn)"},{"issue":"12","key":"688_CR22","first-page":"2973","volume":"48","author":"WH Rui","year":"2020","unstructured":"Rui WH, Sui L, Jian HL. News recommendation algorithm based on the combination of content recommendation and time function. Comput Digital Eng. 2020;48(12):2973\u20137.","journal-title":"Comput Digital Eng"},{"key":"688_CR23","doi-asserted-by":"crossref","unstructured":"Zhang W, Du T, Wang J. Deep learning over multi-field categorical data: a case study on user response prediction. 2016.","DOI":"10.1007\/978-3-319-30671-1_4"},{"key":"688_CR24","doi-asserted-by":"crossref","unstructured":"Pan J, Xu J, Ruiz A L, et al. Field-weighted factorization machines for click-through rate prediction in display advertising. 2018.","DOI":"10.1145\/3178876.3186040"},{"key":"688_CR25","unstructured":"Ye Q, Xiongkai S, Rong G, Chunzhi W, Jing L. Social recommendation algorithm based on attention gated neural network. Comput Eng Appl. 2021; 1\u20139."},{"key":"688_CR26","unstructured":"Yan G. Research on recommendation algorithm based on the convolutional neural network. Nanjing University of Posts and telecommunications, 2020."},{"key":"688_CR27","unstructured":"Gai K, Zhu X, Li H, et al. Learning piece-wise linear models from large scale data for ad click prediction. 2017."},{"key":"688_CR28","unstructured":"Shengyun Z, Hengzhong J. Factorization machine. J Digital Content Soc Korea. 2017; 18."},{"key":"688_CR29","doi-asserted-by":"crossref","unstructured":"Guo H, Tang R, Ye Y, Li X, He X. Deepfm: a factorization-machine-based neural network for ctr prediction. arXiv preprint arXiv:1703.04247; 2017.","DOI":"10.24963\/ijcai.2017\/239"},{"key":"688_CR30","doi-asserted-by":"crossref","unstructured":"Zhou G, Song C, Zhu X, et al. Deep interest network for click-through rate prediction. 2017.","DOI":"10.1145\/3219819.3219823"},{"key":"688_CR31","doi-asserted-by":"crossref","unstructured":"Slim A, Hush D, Ojha T, et al. An automated framework to recommend a suitable academic program, course and instructor[C]\/\/2019 IEEE Fifth International Conference on Big Data Computing Service and Applications (BigDataService). IEEE, 2019.","DOI":"10.1109\/BigDataService.2019.00026"},{"key":"688_CR32","doi-asserted-by":"crossref","unstructured":"Covington P, Adams J, Sargin E. Deep neural networks for youtube recommendations\/\/Acm Conference on Recommender Systems. ACM, 2016;191\u2013198.","DOI":"10.1145\/2959100.2959190"},{"key":"688_CR33","doi-asserted-by":"crossref","unstructured":"Zhang W, Du T, Wang J. Deep learning over multi-field categorical data. In: European conference on information retrieval. Springer, 2016; p. 45\u201357.","DOI":"10.1007\/978-3-319-30671-1_4"},{"key":"688_CR34","doi-asserted-by":"crossref","unstructured":"Zhu J, Shan Y, Mao JC, Yu D, Rahmanian H, Zhang Y. Deep embedding forest: Forest-based serving with deep embedding features. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2017; p. 1703\u20131711.","DOI":"10.1145\/3097983.3098059"},{"key":"688_CR35","doi-asserted-by":"crossref","unstructured":"Wang-Cheng K, McAuley J. Self-attentive sequential recommendation. In 2018 IEEE International Conference on Data Mining (ICDM), p. 197\u2013206. IEEE, 2018.","DOI":"10.1109\/ICDM.2018.00035"},{"key":"688_CR36","doi-asserted-by":"crossref","unstructured":"Zhou G, Zhu X, Song C, Fan Y, Zhu H, Ma X, Yan Y, Jin J, Li H, Gai K. deep interest network for clickthrough rate prediction. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2018; p. 1059\u20131068.","DOI":"10.1145\/3219819.3219823"},{"key":"688_CR37","doi-asserted-by":"crossref","unstructured":"Xiao J, Ye H, He X, Zhang H, Wu F, Chua TS. Attentional factorization machines: learning the weight of feature interactions via attention networks. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence. AAAI Press, 2017; p. 3119\u20133125.","DOI":"10.24963\/ijcai.2017\/435"},{"key":"688_CR38","doi-asserted-by":"crossref","unstructured":"Zhang QL, Rao L, Yang Y. DGFFM: generalized field-aware factorization machine based on DenseNet[C]\/\/2019 International Joint Conference on Neural Networks (IJCNN). 2019.","DOI":"10.1109\/IJCNN.2019.8851933"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-023-00688-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s40537-023-00688-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-023-00688-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T16:13:19Z","timestamp":1675181599000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-023-00688-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,31]]},"references-count":38,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["688"],"URL":"https:\/\/doi.org\/10.1186\/s40537-023-00688-6","relation":{},"ISSN":["2196-1115"],"issn-type":[{"value":"2196-1115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,31]]},"assertion":[{"value":"5 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"11"}}