{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T08:04:35Z","timestamp":1767773075089,"version":"3.41.0"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T00:00:00Z","timestamp":1609718400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100014219","name":"National Science Fund for Distinguished Young Scholars","doi-asserted-by":"crossref","award":["61725205"],"award-info":[{"award-number":["61725205"]}],"id":[{"id":"10.13039\/501100014219","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Key R8D Program of China","award":["2019YFB2102200"],"award-info":[{"award-number":["2019YFB2102200"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["3102019QD1001"],"award-info":[{"award-number":["3102019QD1001"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61960206008, 61772428, and 62002294"],"award-info":[{"award-number":["61960206008, 61772428, and 62002294"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Science Basic Research Plan in Shaanxi Province of China","award":["2020JQ-215"],"award-info":[{"award-number":["2020JQ-215"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2021,4,30]]},"abstract":"<jats:p>In modern online advertising systems, the click-through rate (CTR) is an important index to measure the popularity of an item. It refers to the ratio of users who click on a specific advertisement to the number of total users who view it. Predicting the CTR of an item in advance can improve the accuracy of the advertisement recommendation. And it is commonly calculated based on users\u2019 interests. Thus, extracting users\u2019 interests is of great importance in CTR prediction tasks. In the literature, a lot of studies treat the interaction between users and items as sequential data and apply the recurrent neural network (RNN) model to extract users\u2019 interests. However, these solutions cannot handle the case when the sequence length is relatively long, e.g., over 100. This is because of the vanishing gradient problem of RNN, i.e., the model cannot learn a users\u2019 previous behaviors that are too far away from the current moment. To address this problem, we propose a new Core Interest Network (CIN) model to mitigate the problem of a long sequence in the CTR prediction task with sequential data. In brief, we first extract the core interests of users and then use the refined data as the input of subsequent learning tasks. Extensive evaluations on real dataset show that our CIN model can outperform the state-of-the-art solutions in terms of prediction accuracy.<\/jats:p>","DOI":"10.1145\/3428079","type":"journal-article","created":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T14:34:22Z","timestamp":1609770862000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Core Interest Network for Click-Through Rate Prediction"],"prefix":"10.1145","volume":"15","author":[{"given":"En","family":"Xu","sequence":"first","affiliation":[{"name":"Northwestern Polytechnical University, Shaanxi, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiwen","family":"Yu","sequence":"additional","affiliation":[{"name":"Northwestern Polytechnical University, Shaanxi, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Guo","sequence":"additional","affiliation":[{"name":"Northwestern Polytechnical University, Shaanxi, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helei","family":"Cui","sequence":"additional","affiliation":[{"name":"Northwestern Polytechnical University, Shaanxi, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,1,4]]},"reference":[{"volume-title":"3rd International Conference on Learning Representations (ICLR\u201915)","year":"2014","author":"Bahdanau Dzmitry","key":"e_1_2_1_1_1"},{"volume-title":"Proceedings of the 2016 IEEE 26th International Workshop on Machine Learning for Signal Processing (MLSP\u201916)","year":"2016","author":"Barkan O.","key":"e_1_2_1_2_1"},{"volume-title":"Neurocomputing","author":"Bridle John S.","key":"e_1_2_1_3_1"},{"volume-title":"Canny","year":"2010","author":"Chen Ye","key":"e_1_2_1_4_1"},{"volume-title":"Proceedings of the 1st Workshop on Deep Learning for Recommender Systems (DLRS\u201916)","author":"Cheng Heng-Tze","key":"e_1_2_1_5_1"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/319"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1013203451"},{"volume-title":"Contextual lstm (clstm) models for large scale nlp tasks. arXiv preprint arXiv:1602.06291","year":"2016","author":"Ghosh Shalini","key":"e_1_2_1_8_1"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/239"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883037"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080777"},{"volume-title":"Proceedings of the 8th International Workshop on Data Mining for Online Advertising (ADKDD\u201914)","author":"He Xinran","key":"e_1_2_1_12_1"},{"volume-title":"4th International Conference on Learning Representations (ICLR\u201916)","year":"2015","author":"Hidasi Bal\u00e1zs","key":"e_1_2_1_13_1"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3109859.3109872"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220014"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220023"},{"volume-title":"Article 28 (March","year":"2017","author":"Liu Guannan","key":"e_1_2_1_17_1"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219950"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.3390\/rs9121330"},{"key":"e_1_2_1_20_1","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"van der Maaten Laurens","year":"2008","journal-title":"Journal of Machine Learning Research"},{"volume-title":"Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2671--2679","year":"2018","author":"Parsana Mehul","key":"e_1_2_1_21_1"},{"volume-title":"Practice on long sequential user behavior modeling for click-through rate prediction. arXiv preprint arXiv:1905.09248","year":"2019","author":"Pi Qi","key":"e_1_2_1_22_1"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3109859.3109896"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.127"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242643"},{"volume-title":"Proceedings of the World Wide Web Conference (WWW\u201919)","author":"Tang Jiaxi","key":"e_1_2_1_26_1"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3124749.3124754"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313442"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/3304222.3304315"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-30671-1_4"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33015941"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3428079","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3428079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:23Z","timestamp":1750195463000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3428079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,4]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,4,30]]}},"alternative-id":["10.1145\/3428079"],"URL":"https:\/\/doi.org\/10.1145\/3428079","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2021,1,4]]},"assertion":[{"value":"2020-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-01-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}