{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T15:54:43Z","timestamp":1776786883950,"version":"3.51.2"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T00:00:00Z","timestamp":1577923200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T00:00:00Z","timestamp":1577923200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61572300"],"award-info":[{"award-number":["61572300"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["81871508"],"award-info":[{"award-number":["81871508"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61773246"],"award-info":[{"award-number":["61773246"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Taishan Scholar Program of Shandong Province of China","award":["TSHW201502038"],"award-info":[{"award-number":["TSHW201502038"]}]},{"DOI":"10.13039\/501100007129","name":"Shandong Province Natural Science Foundation","doi-asserted-by":"crossref","award":["ZR2018ZB0419"],"award-info":[{"award-number":["ZR2018ZB0419"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s10489-019-01571-9","type":"journal-article","created":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T12:28:47Z","timestamp":1577968127000},"page":"1192-1203","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":39,"title":["A CTR prediction model based on user interest via attention mechanism"],"prefix":"10.1007","volume":"50","author":[{"given":"Hao","family":"Li","sequence":"first","affiliation":[]},{"given":"Huichuan","family":"Duan","sequence":"additional","affiliation":[]},{"given":"Yuanjie","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Qianqian","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,2]]},"reference":[{"key":"1571_CR1","doi-asserted-by":"crossref","unstructured":"Chapelle O, Rosales R, Rosales R (2015) Simple and scalable response prediction for display advertising [M]. ACM","DOI":"10.1145\/2532128"},{"key":"1571_CR2","unstructured":"Jahrer M, Toscher A, Lee J Y, et al. (2012) Ensemble of collaborative filtering and feature engineered models for click through rate prediction[C]\/\/KDDCup workshop"},{"key":"1571_CR3","unstructured":"Cheng H T, Koc L, Harmsen J, et al. (2016) Wide & Deep Learning for recommender systems[C]\/\/ the workshop on deep learning for recommender systems. ACM, 7\u201310"},{"issue":"4","key":"1571_CR4","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1287\/msom.2014.0491","volume":"16","author":"S Najafi-Asadolahi","year":"2014","unstructured":"Najafi-Asadolahi S, Fridgeirsdottir K (2014) Cost-per-click pricing for display advertising[J]. Manuf Serv Oper Manag 16(4):482\u2013497","journal-title":"Manuf Serv Oper Manag"},{"key":"1571_CR5","doi-asserted-by":"crossref","unstructured":"Richardson M, Dominowska E, Ragno R (2007) \"Predicting clicks: estimating the click-through rate for new ads.\" Proceedings of the 16th international conference on World Wide Web. ACM","DOI":"10.1145\/1242572.1242643"},{"issue":"4","key":"1571_CR6","first-page":"61","volume":"5","author":"O Chapelle","year":"2015","unstructured":"Chapelle O, Manavoglu E, Rosales R (2015) Simple and scalable response prediction for display advertising[J]. ACM Trans Intell Syst Technol (TIST) 5(4):61","journal-title":"ACM Trans Intell Syst Technol (TIST)"},{"key":"1571_CR7","doi-asserted-by":"crossref","unstructured":"Chapelle O (2014) \"Modeling delayed feedback in display advertising.\" Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM","DOI":"10.1145\/2623330.2623634"},{"key":"1571_CR8","doi-asserted-by":"crossref","unstructured":"McMahan, HB, et al. (2013) \"Ad click prediction: a view from the trenches.\" Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM","DOI":"10.1145\/2487575.2488200"},{"issue":"Apr","key":"1571_CR9","first-page":"1471","volume":"11","author":"YW Chang","year":"2010","unstructured":"Chang YW, Hsieh CJ, Chang KW et al (2010) Training and testing low-degree polynomial data mappings via linear SVM[J]. J Mach Learn Res 11(Apr):1471\u20131490","journal-title":"J Mach Learn Res"},{"key":"1571_CR10","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/j.procs.2013.05.103","volume":"17","author":"B Wang","year":"2013","unstructured":"Wang B (2013) Advertisement click-through rate prediction using multiple criteria linear programming regression model [J]. Proc Comput Sci 17:803\u2013811","journal-title":"Proc Comput Sci"},{"issue":"3","key":"1571_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2168752.2168771","volume":"3","author":"Steffen Rendle","year":"2012","unstructured":"Rendle S (2012) \"Factorization machines with libfm.\" ACM Trans Intell Syst Technol (TIST) 3.3: 57","journal-title":"ACM Transactions on Intelligent Systems and Technology"},{"key":"1571_CR12","unstructured":"Rendle S, Schmidt-Thieme L (2010) Pairwise interaction tensor factorization for personalized tag recommendation[C]\/\/proceedings of the third ACM international conference on web search and data mining. ACM:81\u201390"},{"key":"1571_CR13","doi-asserted-by":"crossref","unstructured":"Juan Y, et al. (2016) \"Field-aware factorization machines for CTR prediction.\" Proceedings of the 10th ACM Conference on Recommender Systems. ACM","DOI":"10.1145\/2959100.2959134"},{"key":"1571_CR14","doi-asserted-by":"crossref","unstructured":"He X, et al. (2014) \"Practical lessons from predicting clicks on ads at facebook.\" Proceedings of the Eighth International Workshop on Data Mining for Online Advertising. ACM","DOI":"10.1145\/2648584.2648589"},{"issue":"7553","key":"1571_CR15","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Yann LeCun","year":"2015","unstructured":"LeCun Y, Bengio Y, Hinton G (2015) \"Deep learning.\" Nature 521.7553: 436","journal-title":"Nature"},{"issue":"4","key":"1571_CR16","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1109\/TPAMI.2017.2699184","volume":"40","author":"LC Chen","year":"2018","unstructured":"Chen LC, Papandreou G, Kokkinos I et al (2018) Deeplab: semantic image segmentation with deep convolutional nets, atrous convolution, and fully connected crfs[J]. IEEE Trans Pattern Anal Mach Intell 40(4):834\u2013848","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1571_CR17","unstructured":"Amodei D, Ananthanarayanan S, Anubhai R, et al. (2016) Deep speech 2: End-to-end speech recognition in english and mandarin[C]\/\/International conference on machine learning: 173\u2013182"},{"issue":"3","key":"1571_CR18","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/MCI.2018.2840738","volume":"13","author":"T Young","year":"2018","unstructured":"Young T, Hazarika D, Poria S et al (2018) Recent trends in deep learning based natural language processing[J]. IEEE Comput Intell Mag 13(3):55\u201375","journal-title":"IEEE Comput Intell Mag"},{"key":"1571_CR19","unstructured":"Gao H, Kong D, Lu M et al (2018) Attention convolutional neural network for advertiser-level click-through rate forecasting[C]\/\/proceedings of the 2018 world wide web conference on world wide web. International World Wide Web Conferences Steering Committee:1855\u20131864"},{"key":"1571_CR20","first-page":"45","volume-title":"Deep learning over multi-field categorical data[C]\/\/European conference on information retrieval","author":"W Zhang","year":"2016","unstructured":"Zhang W, Du T, Wang J (2016) Deep learning over multi-field categorical data[C]\/\/European conference on information retrieval. Springer, Cham, pp 45\u201357"},{"key":"1571_CR21","unstructured":"Liu Q, Yu F, Wu S et al (2015) A convolutional click prediction model[C]\/\/proceedings of the 24th ACM international on conference on information and knowledge management. ACM:1743\u20131746"},{"key":"1571_CR22","unstructured":"Zhang Y, Dai H, Xu C, et al. (2014) Sequential Click Prediction for Sponsored Search with Recurrent Neural Networks[C]\/\/AAAI. 14: 1369\u20131375"},{"key":"1571_CR23","unstructured":"Qu Y, Cai H, Ren K et al (2016) Product-based neural networks for user response prediction[C]\/\/2016 IEEE 16th international conference on data mining (ICDM). IEEE:1149\u20131154"},{"key":"1571_CR24","unstructured":"Shan Y, Hoens TR, Jiao J et al (2016) Deep crossing: web-scale modeling without manually crafted combinatorial features[C]\/\/proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. ACM:255\u2013262"},{"key":"1571_CR25","doi-asserted-by":"crossref","unstructured":"Zagoruyko S, Komodakis N (2016) Wide residual networks[J]. arXiv preprint arXiv:1605.07146","DOI":"10.5244\/C.30.87"},{"key":"1571_CR26","unstructured":"Wang R, Fu B, Fu G et al (2017) Deep & cross network for ad click predictions[C]\/\/proceedings of the ADKDD'17. ACM 12"},{"key":"1571_CR27","unstructured":"Guo H, Tang R, Ye Y, et al. (2018) DeepFM: An End-to-End Wide & Deep Learning Framework for CTR Prediction[J]. arXiv preprint arXiv:1804.04950"},{"key":"1571_CR28","doi-asserted-by":"crossref","unstructured":"Xiao J, Ye H, He X, et al. (2017) Attentional factorization machines: Learning the weight of feature interactions via attention networks[J]. arXiv preprint arXiv:1708.04617","DOI":"10.24963\/ijcai.2017\/435"},{"key":"1571_CR29","unstructured":"Vaswani A, Shazeer N, Parmar N, et al. (2017) Attention is all you need[C]\/\/Advances in neural information processing systems: 5998\u20136008"},{"key":"1571_CR30","doi-asserted-by":"crossref","unstructured":"Wang Q, Liu F, Xing S et al (2018) A new approach for advertising CTR prediction based on deep neural network via attention mechanism[J]. Comput Math Method Med 2018","DOI":"10.1155\/2018\/8056541"},{"key":"1571_CR31","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.asoc.2017.09.040","volume":"62","author":"F Ghasemi","year":"2018","unstructured":"Ghasemi F, Mehridehnavi A, Fassihi A et al (2018) Deep neural network in QSAR studies using deep belief network[J]. Appl Soft Comput 62:251\u2013258","journal-title":"Appl Soft Comput"},{"key":"1571_CR32","unstructured":"Zhou G, Zhu X, Song C et al (2018) Deep interest network for click-through rate prediction[C]\/\/proceedings of the 24th ACM SIGKDD international conference on Knowledge Discovery & Data Mining. ACM:1059\u20131068"},{"key":"1571_CR33","unstructured":"Chung J, Gulcehre C, Cho KH, et al. (2014) Empirical evaluation of gated recurrent neural networks on sequence modeling[J]. arXiv preprint arXiv:1412.3555"},{"issue":"8","key":"1571_CR34","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter S, Schmidhuber J (1997) Long short-term memory[J]. Neural Comput 9(8):1735\u20131780","journal-title":"Neural Comput"},{"key":"1571_CR35","unstructured":"Hidasi B, Karatzoglou A, Baltrunas L, et al. (2015) Session-based recommendations with recurrent neural networks[J]. arXiv preprint arXiv:1511.06939"},{"key":"1571_CR36","unstructured":"Vincent P, Larochelle H, Bengio Y, et al. Extracting and composing robust features with denoising autoencoders[C]\/\/Proceedings of the 25th international conference"},{"key":"1571_CR37","unstructured":"Baltrunas L, et al. (2015) \"Frappe: Understanding the usage and perception of mobile app recommendations in-the-wild.\" arXiv preprint arXiv:1505.03014"},{"issue":"4","key":"1571_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2827872","volume":"5","author":"F. Maxwell Harper","year":"2015","unstructured":"Harper FM, Konstan JA (2016) \"The movielens datasets: History and context.\" ACM Transactions on Interactive Intelligent Systems (TiiS) 5.4: 19","journal-title":"ACM Transactions on Interactive Intelligent Systems"},{"issue":"8","key":"1571_CR39","doi-asserted-by":"publisher","first-page":"2264","DOI":"10.1177\/0962280216680239","volume":"27","author":"L Li","year":"2018","unstructured":"Li L, Greene T, Hu B (2018) A simple method to estimate the time-dependent receiver operating characteristic curve and the area under the curve with right censored data[J]. Stat Methods Med Res 27(8):2264\u20132278","journal-title":"Stat Methods Med Res"},{"key":"1571_CR40","doi-asserted-by":"publisher","first-page":"75032","DOI":"10.1109\/ACCESS.2019.2921026","volume":"7","author":"L Zhang","year":"2019","unstructured":"Zhang L, Shen W, Huang J et al (2019) Field-aware neural factorization machine for click-through rate prediction[J]. IEEE Access 7:75032\u201375040","journal-title":"IEEE Access"},{"key":"1571_CR41","doi-asserted-by":"crossref","unstructured":"Holzinger A (2018) \"From machine learning to explainable AI.\" 2018 World Symposium on Digital Intelligence for Systems and Machines (DISA). IEEE","DOI":"10.1109\/DISA.2018.8490530"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-019-01571-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-019-01571-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-019-01571-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:49:52Z","timestamp":1609462192000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-019-01571-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,2]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["1571"],"URL":"https:\/\/doi.org\/10.1007\/s10489-019-01571-9","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,2]]},"assertion":[{"value":"2 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}