{"title":"基于时间感知的多层兴趣提取网络的点击率预测","authors":"Guoan Wang, Xingjun Wang","doi":"10.1109/CACML55074.2022.00136","DOIUrl":null,"url":null,"abstract":"Click-through rate (CTR) prediction, which is used to estimate the probability of a user clicking on a candidate item, acts as a core task in recommender system. Previous researchers model user's historical behaviors as a sequence and apply sequential models to extract user interests. However, user behaviors result from multiple factors, including not only their interests but also the time, especially in time-sensitive scenes. While a few researchers have considered behavior time in sequential modeling, the target predicted time is still ignored. In this paper, we propose a novel network for CTR prediction dubbed Time-aware Multi-layer Interest Extraction network (TMIE), which considers the influence imposed by user behavior time and the target predicted time along-side with modeling user interests. Specifically, we design and employ time-aware GRU as low-layer interest extractor to capture primary interests. Then simplified transformer is applied as high-layer extractor to further explore the mutual relevance among user's interests. We perform abundant comparative experiments on both public and industrial datasets and the excellent results demonstrate the rationality and effectiveness of our methods. Notably, our heuristic work is an exciting attempt to catch up the synergistic impact of behavior time and multi-layer user interests in CTR prediction.","PeriodicalId":137505,"journal":{"name":"2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Time-aware Multi-layer Interest Extraction Network for Click-Through Rate Prediction\",\"authors\":\"Guoan Wang, Xingjun Wang\",\"doi\":\"10.1109/CACML55074.2022.00136\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Click-through rate (CTR) prediction, which is used to estimate the probability of a user clicking on a candidate item, acts as a core task in recommender system. Previous researchers model user's historical behaviors as a sequence and apply sequential models to extract user interests. However, user behaviors result from multiple factors, including not only their interests but also the time, especially in time-sensitive scenes. While a few researchers have considered behavior time in sequential modeling, the target predicted time is still ignored. In this paper, we propose a novel network for CTR prediction dubbed Time-aware Multi-layer Interest Extraction network (TMIE), which considers the influence imposed by user behavior time and the target predicted time along-side with modeling user interests. Specifically, we design and employ time-aware GRU as low-layer interest extractor to capture primary interests. Then simplified transformer is applied as high-layer extractor to further explore the mutual relevance among user's interests. We perform abundant comparative experiments on both public and industrial datasets and the excellent results demonstrate the rationality and effectiveness of our methods. Notably, our heuristic work is an exciting attempt to catch up the synergistic impact of behavior time and multi-layer user interests in CTR prediction.\",\"PeriodicalId\":137505,\"journal\":{\"name\":\"2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CACML55074.2022.00136\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CACML55074.2022.00136","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Time-aware Multi-layer Interest Extraction Network for Click-Through Rate Prediction
Click-through rate (CTR) prediction, which is used to estimate the probability of a user clicking on a candidate item, acts as a core task in recommender system. Previous researchers model user's historical behaviors as a sequence and apply sequential models to extract user interests. However, user behaviors result from multiple factors, including not only their interests but also the time, especially in time-sensitive scenes. While a few researchers have considered behavior time in sequential modeling, the target predicted time is still ignored. In this paper, we propose a novel network for CTR prediction dubbed Time-aware Multi-layer Interest Extraction network (TMIE), which considers the influence imposed by user behavior time and the target predicted time along-side with modeling user interests. Specifically, we design and employ time-aware GRU as low-layer interest extractor to capture primary interests. Then simplified transformer is applied as high-layer extractor to further explore the mutual relevance among user's interests. We perform abundant comparative experiments on both public and industrial datasets and the excellent results demonstrate the rationality and effectiveness of our methods. Notably, our heuristic work is an exciting attempt to catch up the synergistic impact of behavior time and multi-layer user interests in CTR prediction.