{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T14:25:37Z","timestamp":1770647137469,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T00:00:00Z","timestamp":1579219200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T00:00:00Z","timestamp":1579219200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"National Science Foundation","award":["CNS-1828181"],"award-info":[{"award-number":["CNS-1828181"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2020,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>User interest and behavior modeling is a critical step in online digital advertising. On the one hand, user interests directly impact their response and actions to the displayed advertisement (Ad). On the other hand, user interests can further help determine the probability of an Ad viewer becoming a buying customer. To date, existing methods for Ad click prediction, or click-through rate prediction, mainly consider representing users as a static feature set and train machine learning classifiers to predict clicks. Such approaches do not consider temporal variance and changes in user behaviors, and solely rely on given features for learning. In this paper, we propose two deep learning-based frameworks,<jats:inline-formula><jats:alternatives><jats:tex-math>$${\\hbox {LSTM}}_{\\mathrm{cp}}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:msub><mml:mtext>LSTM<\/mml:mtext><mml:mi>cp<\/mml:mi><\/mml:msub><\/mml:math><\/jats:alternatives><\/jats:inline-formula>and<jats:inline-formula><jats:alternatives><jats:tex-math>$${\\hbox {LSTM}}_{\\mathrm{ip}}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:msub><mml:mtext>LSTM<\/mml:mtext><mml:mi>ip<\/mml:mi><\/mml:msub><\/mml:math><\/jats:alternatives><\/jats:inline-formula>, for user click prediction and user interest modeling. Our goal is to accurately predict (1) the probability of a user clicking on an Ad and (2) the probability of a user clicking a specific type of Ad campaign. To achieve the goal, we collect page information displayed to the users as a temporal sequence and use long\u00a0short-term memory (LSTM) network to learn features that represents user interests as latent features. Experiments and comparisons on real-world data show that, compared to existing static set-based approaches, considering sequences and temporal variance of user requests results in improvements in user Ad response prediction and campaign specific user Ad click prediction.<\/jats:p>","DOI":"10.1007\/s41019-019-00115-y","type":"journal-article","created":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T09:03:02Z","timestamp":1579251782000},"page":"12-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":93,"title":["Deep Learning for User Interest and Response Prediction in Online Display Advertising"],"prefix":"10.1007","volume":"5","author":[{"given":"Zhabiz","family":"Gharibshah","sequence":"first","affiliation":[]},{"given":"Xingquan","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Arthur","family":"Hainline","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Conway","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,17]]},"reference":[{"key":"115_CR1","doi-asserted-by":"crossref","unstructured":"Zhu X, Tao H, Wu Z, Cao J, Kalish K, Kayne J (2017) Fraud prevention in online digital advertising. Springer briefs in computer science. ISBN 978-3-319-56792-1, pp 1\u201351","DOI":"10.1007\/978-3-319-56793-8"},{"key":"115_CR2","unstructured":"IAB (2016) POpenRTB API specification version 2.5. https:\/\/www.iab.com\/guidelines\/real-time-bidding-rtb-project. Accessed 15 Mar 2019"},{"key":"115_CR3","doi-asserted-by":"crossref","unstructured":"Liu H, Zhu X, Kalish K, Kayne J (2017) ULTR-CTR: fast page grouping using URL truncation for real-time click through rate estimation. In: Proceedings of the of the IEEE international conference on information reuse and integration (IRI), pp 444\u2013451","DOI":"10.1109\/IRI.2017.55"},{"key":"115_CR4","unstructured":"Ormandi R, Yang H, Lu Q (2015) Scalable multidimensional hierarchical Bayesian modeling on spark. In: Wei F, Albert B, Qiang Y, Philip SY (eds) Proceedings of the 4th international conference on big data, streams and heterogeneous source mining: algorithms, systems, programming models and applications (BIGMINE\u201915), vol 41. JMLR.org, pp 33\u201348"},{"key":"115_CR5","doi-asserted-by":"crossref","unstructured":"Li C, Lu Y, Mei Q, Wang D, Pandey S (2015) Click-through prediction for advertising in twitter timeline. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining (KDD). ACM, New York, NY, USA, pp 1959\u20131968","DOI":"10.1145\/2783258.2788582"},{"key":"115_CR6","doi-asserted-by":"crossref","unstructured":"Guo H, Tang R, Ye Y, Li Z, He X (2017) DeepFM: a factorization-machine based neural network for CTR prediction. In: Proceedings of the 26th international joint conference on artificial intelligence, Melbourne, Australia, August 19\u201325","DOI":"10.24963\/ijcai.2017\/239"},{"key":"115_CR7","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-030-26072-9_14","volume-title":"Web and Big Data","author":"Zhabiz Gharibshah","year":"2019","unstructured":"Gharibshah Z, Zhu X, Hainline A, Conway M (2019) Deep learning for online display advertising user clicks and interests prediction. In: Proceedings of the Asia Pacific Web (APWeb) and web-age information management (WAIM) joint conference on web and big data (APWeb-WAIM), pp 196\u2013204"},{"key":"115_CR8","doi-asserted-by":"crossref","unstructured":"Richardson M, Dominowska E, Ragno R (2007) Predicting clicks: estimating the click-through rate for new ads. In: Proceedings of the 16th international conference on world wide web, ACM, New York, NY, USA, pp 521\u2013530","DOI":"10.1145\/1242572.1242643"},{"issue":"1","key":"115_CR9","first-page":"521","volume":"136","author":"CP Avila","year":"2016","unstructured":"Avila CP, Vijaya MS (2016) Click through rate prediction for display advertisement. Int J Comput Appl 136(1):521\u2013530","journal-title":"Int J Comput Appl"},{"key":"115_CR10","first-page":"1","volume-title":"Online multimedia advertising: techniques and technologies","author":"X Wang","year":"2010","unstructured":"Wang X, Li W, Cui Y, Zhang R, Mao J (2010) Click-through rate estimation for rare events in online advertising. In: Hua XS (ed) Online multimedia advertising: techniques and technologies. IGI Global, Hershey, pp 1\u201312"},{"key":"115_CR11","doi-asserted-by":"crossref","unstructured":"Rendle S (2010) Factorization machines. In: Proceedings of the 2010 IEEE international conference on data mining (ICDM), December 13\u201317, pp 995\u20131000","DOI":"10.1109\/ICDM.2010.127"},{"key":"115_CR12","doi-asserted-by":"crossref","unstructured":"Qu Y, Cai H, Ren K, Zhang W, Yu Y, Wen Y, Wang J (2016) Product based neural networks for user response prediction. In: IEEE 16th international conference on data mining (ICDM), pp 1149\u20131154","DOI":"10.1109\/ICDM.2016.0151"},{"key":"115_CR13","doi-asserted-by":"crossref","unstructured":"Liu Q, Yu F, Wu S, Wang L (2015) A convolutional click prediction model. In: Proceedings of the 24th ACM international on conference on information and knowledge management (CIKM). ACM, New York, NY, USA, pp 1743\u20131746","DOI":"10.1145\/2806416.2806603"},{"key":"115_CR14","doi-asserted-by":"crossref","unstructured":"Deng W, Ling X, Qi Y, Tan T, Manavoglu E, Zhang Q (2018) Ad click prediction in sequence with long short-term memory networks: an externality-aware model. In: The 41st international ACM SIGIR conference on research and development in information retrieval (SIGIR \u201918). ACM, New York, NY, USA, pp 1065\u20131068","DOI":"10.1145\/3209978.3210071"},{"issue":"4","key":"115_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2532128","volume":"5","author":"Olivier Chapelle","year":"2014","unstructured":"Chapelle O, Manavoglu E, Rosales R (2014) Simple and scalable response prediction for display advertising. ACM Trans Intell Syst Technol 5(4), Article 61","journal-title":"ACM Transactions on Intelligent Systems and Technology"},{"issue":"3","key":"115_CR16","first-page":"1","volume":"35","author":"Dongxiang Zhang","year":"2017","unstructured":"Zhang D, Guo L, Nie L, Shao J, Wu S, Shen HT (2017) Targeted advertising in public transportation systems with quantitative evaluation. ACM Trans Inf Syst 35(3), Article 20","journal-title":"ACM Transactions on Information Systems"},{"issue":"3","key":"115_CR17","first-page":"28:1","volume":"35","author":"D Zhang","year":"2017","unstructured":"Zhang D, Li Y, Fan J, Gao L, Shen F, Shen HT (2017) Processing long queries against short text: top-k advertisement matching in news stream applications. ACM TOIS 35(3):28:1\u201328:27","journal-title":"ACM TOIS"},{"key":"115_CR18","unstructured":"European Commission (2018) 2018 reform EU data protection rules. https:\/\/ec.europa.eu\/commission\/priorities\/justice-and-fundamental-rights\/data-protection\/2018-reform-eu-data-protection-rules_en. Accessed 15 Mar 2019"},{"key":"115_CR19","doi-asserted-by":"crossref","unstructured":"Su N, He J, Liu Y, Zhang M, Ma S (2018) User intent, behaviour, and perceived satisfaction in product search. In: Proceedings of the eleventh ACM international conference on web search and data mining (WSDM). ACM, New York, NY, USA pp 547\u2013555","DOI":"10.1145\/3159652.3159714"},{"key":"115_CR20","unstructured":"Sheil H, Rana O, Reilly R (2018) Predicting purchasing intent: automatic feature learning using recurrent neural networks. arXiv:1807.08207"},{"key":"115_CR21","doi-asserted-by":"crossref","unstructured":"Liu Q, Wu S, Wang L, Tan T (2016) Predicting the next location: a recurrent model with spatial and temporal contexts. In: Proceedings of the thirtieth AAAI conference on artificial intelligence (AAAI). AAAI Press, pp 194\u2013200","DOI":"10.1609\/aaai.v30i1.9971"},{"key":"115_CR22","doi-asserted-by":"crossref","unstructured":"Zhou G, Mou N, Fan Y, Pi Q, Bian W, Zhou C, Zhu X, Gai K (2019) Deep interest evolution network for click-through rate prediction. In: Proceedings of the AAAI conference on artificial intelligence, vol 33(01)","DOI":"10.1609\/aaai.v33i01.33015941"},{"key":"115_CR23","doi-asserted-by":"crossref","unstructured":"Feng Y, Lv F, Shen W, Wang M, Sun F, Zhu Y, Yang K (2019) Deep session interest network for click-through rate prediction. In: Sarit Kraus (ed) Proceedings of the 28th international joint conference on artificial intelligence (IJCAI\u201919). AAAI Press, pp 2301\u20132307","DOI":"10.24963\/ijcai.2019\/319"},{"key":"115_CR24","unstructured":"IAB (2017) Iab tech lab content taxonomy. https:\/\/www.iab.com\/guidelines\/iab-quality-assurance-guidelines-qag-taxonomy\/. Accessed 15 Mar 2019"},{"key":"115_CR25","doi-asserted-by":"crossref","unstructured":"Agarwal D, Agrawal R, Khanna R, Kota N (2010) Estimating rates of rare events with multiple hierarchies through scalable log-linear models. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD). ACM, New York, NY, USA, pp 213\u2013222","DOI":"10.1145\/1835804.1835834"},{"key":"115_CR26","unstructured":"Lipton ZC, Berkowitz J, Elkan C (2015) A critical review of recurrent neural networks for sequence learning. arXiv:1506.00019"},{"key":"115_CR27","doi-asserted-by":"publisher","first-page":"e1253","DOI":"10.1002\/widm.1253","volume":"8","author":"L Zhang","year":"2018","unstructured":"Zhang L, Wang S, Liu B (2018) Deep learning for sentiment analysis : a survey. Wiley Interdiscip Rev Data Min Knowl Discov 8:e1253","journal-title":"Wiley Interdiscip Rev Data Min Knowl Discov"},{"key":"115_CR28","doi-asserted-by":"crossref","unstructured":"Guo T, Zhu X, Wang Y, Chen F (2019) Discriminative sample generation for deep imbalanced learning. In: Proceedings of the international joint conference on artificial intelligence (IJCAI), pp 2406\u20132412","DOI":"10.24963\/ijcai.2019\/334"},{"key":"115_CR29","unstructured":"Cheng H-T, Koc L, Harmsen J, Shaked T, Chandra T, Aradhye H, Anderson G, Corrado G, Chai W, Ispir M, Anil R, Haque Z, Hong L, Jain V, Liu X, Shah H (2016) Wide and deep learning for recommender systems. In: Proceedings of the 1st workshop on deep learning for recommender systems (DLRS 2016). ACM, New York, NY, USA, pp 7\u201310"},{"key":"115_CR30","doi-asserted-by":"crossref","unstructured":"Kim Y (2014) Convolutional neural networks for sentence classification. In: Proceedings of the 2014 conference on empirical methods in natural language processing (EMNLP). Doha, Qatar, pp 1746\u20131751","DOI":"10.3115\/v1\/D14-1181"},{"key":"115_CR31","doi-asserted-by":"crossref","unstructured":"Zhang Y, Dai H, Xu C, Feng J, Wang T, Bian J, Wang B, Liu T-Y (2014) Sequential click prediction for sponsored search with recurrent neural networks. In: Proceedings of the twenty-eighth AAAI conference on artificial intelligence (AAAI). AAAI Press, pp 1369\u20131375","DOI":"10.1609\/aaai.v28i1.8917"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-019-00115-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41019-019-00115-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-019-00115-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T19:49:58Z","timestamp":1665517798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41019-019-00115-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,17]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["115"],"URL":"https:\/\/doi.org\/10.1007\/s41019-019-00115-y","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,17]]},"assertion":[{"value":"13 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}