Improving CTR Prediction with Graph-Enhanced Interest Networks for Sparse Behavior Sequences
Authors: 
Xuanzhou Liu, Zhibo Xiao, Luwei Yang, Hansheng Xue, Jianxing Ma, Yujiu YangAuthors Info & Claims
Pages 876 - 884
Abstract
Predicting click-through rates is crucial in various fields, including online advertising and recommendation systems. The key to improving the performance of CTR prediction lies in learning a robust user representation, particularly by analyzing their historical behaviors. Previous studies usually model behavior sequences through attention-based sequence models or graph-based methods, which usually struggle to explore diverse latent interests or accurately model user behaviors. Moreover, this challenge is exacerbated when users' historical behaviors are sparse, a common issue in real-world business-to-business (B2B) e-commerce scenarios. In this paper, we propose a novel Graph-Enhanced Interest Network (GEIN) to capture users' latent intents and facilitate the sequential learning of sparse behavior sequences. Specifically, we first construct a hierarchical item-intent heterogeneous graph to enrich the representation of sparse behaviors using diverse information from graphs. Next, we build a user-level behavior interest factor graph to accurately capture user interests. Additionally, a contrastive learning mechanism is incorporated to mitigate the negative robustness impacts caused by sparsity. Extensive experiments on real-world datasets demonstrate that our proposed GEIN outperforms a wide range of state-of-the-art methods. Furthermore, online A/B testing also confirms the superiority of GEIN over competing baselines in a real-world production environment.
References
[1]
Julian Besag. 1974. Spatial Interaction and the Statistical Analysis of Lattice Systems. Journal of the Royal Statistical Society. Series B (Methodological), Vol. 36, 2 (1974), 192--236. http://www.jstor.org/stable/2984812
[2]
Ting Chen, Simon Kornblith, Mohammad Norouzi, and Geoffrey Hinton. 2020. A simple framework for contrastive learning of visual representations. In International conference on machine learning. PMLR, 1597--1607.
[3]
Yongjun Chen, Zhiwei Liu, Jia Li, Julian McAuley, and Caiming Xiong. 2022. Intent Contrastive Learning for Sequential Recommendation. In Proceedings of the ACM Web Conference 2022 (Virtual Event, Lyon, France) (WWW '22). Association for Computing Machinery, New York, NY, USA, 2172--2182. https://doi.org/10.1145/3485447.3512090
[4]
Heng-Tze Cheng, Levent Koc, Jeremiah Harmsen, Tal Shaked, Tushar Chandra, Hrishi Aradhye, Glen Anderson, Greg Corrado, Wei Chai, Mustafa Ispir, et al. 2016. Wide & deep learning for recommender systems. In the 1st workshop on deep learning for recommender systems. 7--10.
[5]
Zhihong Cui, Xiangguo Sun, Hongxu Chen, Li Pan, Lizhen Cui, Shijun Liu, and Guandong Xu. 2024. Dynamic Recommendation Based on Graph Diffusion and Ebbinghaus Curve. IEEE Transactions on Computational Social Systems, Vol. 11, 2 (2024), 2755--2764. https://doi.org/10.1109/TCSS.2023.3267611
[6]
Yufei Feng, Fuyu Lv, Weichen Shen, Menghan Wang, Fei Sun, Yu Zhu, and Keping Yang. 2019. Deep session interest network for click-through rate prediction. In the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI-19).
[7]
Wei Guo, Rong Su, Renhao Tan, Huifeng Guo, Yingxue Zhang, Zhirong Liu, Ruiming Tang, and Xiuqiang He. 2021. Dual Graph enhanced Embedding Neural Network for CTR Prediction. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining.
[8]
Nouhaila Idrissi and Ahmed Zellou. 2020. A systematic literature review of sparsity issues in recommender systems. Social Network Analysis and Mining, Vol. 10, 1 (2020), 15.
[9]
Folasade Olubusola Isinkaye, Yetunde O Folajimi, and Bolande Adefowoke Ojokoh. 2015. Recommendation systems: Principles, methods and evaluation. Egyptian informatics journal, Vol. 16, 3 (2015), 261--273.
[10]
Wensen Jiang, Yizhu Jiao, Qingqin Wang, Chuanming Liang, Lijie Guo, Yao Zhang, Zhijun Sun, Yun Xiong, and Yangyong Zhu. 2022. Triangle Graph Interest Network for Click-through Rate Prediction. In Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining.
[11]
Zahid Younas Khan, Zhendong Niu, Sulis Sandiwarno, and Rukundo Prince. 2021. Deep learning techniques for rating prediction: a survey of the state-of-the-art. Artificial Intelligence Review, Vol. 54 (2021), 95--135.
[12]
Feng Li, Zhenrui Chen, Pengjie Wang, Yi Ren, Di Zhang, and Xiaoyu Zhu. 2019. Graph Intention Network for Click-through Rate Prediction in Sponsored Search. In Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval. 961--964.
[13]
Haoyang Li, Xin Wang, Ziwei Zhang, Jianxin Ma, Peng Cui, and Wenwu Zhu. 2022a. Intention-Aware Sequential Recommendation With Structured Intent Transition. IEEE Transactions on Knowledge and Data Engineering, Vol. 34, 11 (2022), 5403--5414. https://doi.org/10.1109/TKDE.2021.3050571
[14]
Jiacheng Li, Tong Zhao, Jin Li, Jim Chan, Christos Faloutsos, George Karypis, Soo-Min Pantel, and Julian McAuley. 2022b. Coarse-to-Fine Sparse Sequential Recommendation. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval (Madrid, Spain) (SIGIR '22). Association for Computing Machinery, New York, NY, USA, 2082--2086. https://doi.org/10.1145/3477495.3531732
[15]
Pan Li, Yanbang Wang, Hongwei Wang, and Jure Leskovec. 2020. Distance Encoding: Design Provably More Powerful Neural Networks for Graph Representation Learning. arxiv: 2009.00142 [cs.LG]
[16]
Yicong Li, Xiangguo Sun, Hongxu Chen, Sixiao Zhang, Yu Yang, and Guandong Xu. 2024. Attention Is Not the Only Choice: Counterfactual Reasoning for Path-Based Explainable Recommendation. IEEE Transactions on Knowledge and Data Engineering, Vol. 36, 9 (Sept. 2024), 4458--4471. https://doi.org/10.1109/tkde.2024.3373608
[17]
Jinwei Luo, Mingkai He, Weike Pan, and Zhong Ming. 2023. BGNN: Behavior-aware graph neural network for heterogeneous session-based recommendation. Front. Comput. Sci., Vol. 17, 5 (jan 2023), 16 pages. https://doi.org/10.1007/s11704-022--2100-y
[18]
Takanobu Omura, Kenta Suzuki, Panote Siriaraya, Mohit Mittal, Yukiko Kawai, and Shinsuke Nakajima. 2020. Ad Recommendation utilizing user behavior in the physical space to represent their latent interest. In 2020 IEEE International Conference on Big Data (Big Data). 3143--3146. https://doi.org/10.1109/BigData50022.2020.9377822
[19]
Ruihong Qiu, Zi Huang, Hongzhi Yin, and Zijian Wang. 2022a. Contrastive Learning for Representation Degeneration Problem in Sequential Recommendation. In Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining (Virtual Event, AZ, USA) (WSDM '22). Association for Computing Machinery, New York, NY, USA, 813--823. https://doi.org/10.1145/3488560.3498433
[20]
Ruihong Qiu, Zi Huang, Hongzhi Yin, and Zijian Wang. 2022b. Contrastive Learning for Representation Degeneration Problem in Sequential Recommendation. In Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining (WSDM '22). ACM. https://doi.org/10.1145/3488560.3498433
[21]
Yanru Qu, Han Cai, Kan Ren, Weinan Zhang, Yong Yu, Ying Wen, and Jun Wang. 2016. Product-based neural networks for user response prediction. In IEEE 16th International Conference on Data Mining (ICDM).
[22]
Matthew Richardson, Ewa Dominowska, and Robert Ragno. 2007. Predicting clicks: estimating the click-through rate for new ads. In Proceedings of the 16th international conference on World Wide Web. 521--530.
[23]
Qijie Shen, Hong Wen, Wanjie Tao, Jing Zhang, Fuyu Lv, Zulong Chen, and Zhao Li. 2022. Deep Interest Highlight Network for Click-Through Rate Prediction in Trigger-Induced Recommendation. In The Web Conference.
[24]
Monika Singh. 2020. Scalability and sparsity issues in recommender datasets: a survey. Knowledge and Information Systems, Vol. 62, 1 (2020), 1--43.
[25]
Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. In Advances in neural information processing systems. 5998--6008.
[26]
Roman Vershynin. 2018. High-Dimensional Probability: An Introduction with Applications in Data Science. Cambridge University Press. https://doi.org/10.1017/9781108231596
[27]
Yifan Wang, Yifang Qin, Fang Sun, Bo Zhang, Xuyang Hou, Ke Hu, Jia Cheng, Jun Lei, and Ming Zhang. 2022. DisenCTR: Dynamic Graph-based Disentangled Representation for Click-Through Rate Prediction. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval.
[28]
Zhibo Xiao, Luwei Yang, Wen Jiang, Yi Wei, Yi Hu, and Hao Wang. 2020. Deep multi-interest network for click-through rate prediction. In Proceedings of the 29th ACM International Conference on Information & Knowledge Management.
[29]
Hansheng Xue, Luwei Yang, Vaibhav Rajan, Wen Jiang, Yi Wei, and Yu Lin. 2021. Multiplex bipartite network embedding using dual hypergraph convolutional networks. In Proceedings of the Web Conference 2021. 1649--1660.
[30]
Junhan Yang, Zheng Liu, Shitao Xiao, Chaozhuo Li, Defu Lian, Sanjay Agrawal, Amit Singh, Guangzhong Sun, and Xing Xie. 2021. Graphformers: Gnn-nested transformers for representation learning on textual graph. Advances in Neural Information Processing Systems, Vol. 34 (2021), 28798--28810.
[31]
Yuhao Yang, Chao Huang, Lianghao Xia, and Chenliang Li. 2022. Knowledge Graph Contrastive Learning for Recommendation. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '22). ACM. https://doi.org/10.1145/3477495.3532009
[32]
Wei Yinwei, Wang Xiang, He Xiangnan, Nie Liqiang, Rui Yong, and Chua Tat-Seng. 2021. Hierarchical User Intent Graph Network forMultimedia Recommendation. arxiv: 2110.14925 [cs.IR]
[33]
Junliang Yu, Hongzhi Yin, Xin Xia, Tong Chen, Lizhen Cui, and Quoc Viet Hung Nguyen. 2022. Are Graph Augmentations Necessary? Simple Graph Contrastive Learning for Recommendation. arxiv: 2112.08679 [cs.IR]
[34]
Weinan Zhang, Jiarui Qin, Wei Guo, Ruiming Tang, and Xiuqiang He. 2021. Deep Learning for Click-Through Rate Estimation. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21.
[35]
Guorui Zhou, Na Mou, Ying Fan, Qi Pi, Weijie Bian, Chang Zhou, Xiaoqiang Zhu, and Kun Gai. 2019. Deep interest evolution network for click-through rate prediction. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 33. 5941--5948.
[36]
Guorui Zhou, Xiaoqiang Zhu, Chenru Song, Ying Fan, Han Zhu, Xiao Ma, Yanghui Yan, Junqi Jin, Han Li, and Kun Gai. 2018a. Deep interest network for click-through rate prediction. In Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining. 1059--1068.
[37]
Guorui Zhou, Xiaoqiang Zhu, Chenru Song, Ying Fan, Han Zhu, Xiao Ma, Yanghui Yan, Junqi Jin, Han Li, and Kun Gai. 2018b. Deep interest network for click-through rate prediction. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 1059--1068.
[38]
Jieming Zhu, Jinyang Liu, Shuai Yang, Qi Zhang, and Xiuqiang He. 2021. Open benchmarking for click-through rate prediction. In Proceedings of the 30th ACM international conference on information & knowledge management. 2759--2769.
[39]
Ding Zou, Wei Wei, Feida Zhu, Chuanyu Xu, Tao Zhang, and Chengfu Huo. 2024. Knowledge Enhanced Multi-intent Transformer Network for Recommendation. In Companion Proceedings of the ACM on Web Conference 2024 (Singapore, Singapore) (WWW '24). Association for Computing Machinery, New York, NY, USA, 1--9. https://doi.org/10.1145/3589335.3648296
Index Terms
- Improving CTR Prediction with Graph-Enhanced Interest Networks for Sparse Behavior Sequences
Recommendations
Deep Evolutional Instant Interest Network for CTR Prediction in Trigger-Induced Recommendation
WSDM '24: Proceedings of the 17th ACM International Conference on Web Search and Data MiningThe recommendation has been playing a key role in many industries, e.g., e-commerce, streaming media, social media, etc. Recently, a new recommendation scenario, called Trigger-Induced Recommendation (TIR), where users are able to explicitly express ...
MIN: multi-dimensional interest network for click-through rate prediction
AbstractClick-through rate (CTR) prediction is a critical task in recommender systems and online advertising systems. The extensive collection of behavior data has become popular for building prediction models by capturing user interests from behavior ...
MLoRA: Multi-Domain Low-Rank Adaptive Network for CTR Prediction
RecSys '24: Proceedings of the 18th ACM Conference on Recommender SystemsClick-through rate (CTR) prediction is one of the fundamental tasks in the industry, especially in e-commerce, social media, and streaming media. It directly impacts website revenues, user satisfaction, and user retention. However, real-world production ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
March 2025
1151 pages
ISBN:9798400713293
DOI:10.1145/3701551
- General Chairs:
- Wolfgang Nejdl,
- Sören Auer,
- Proceedings Chair:
- Oliver Karras,
- Program Chairs:
- Meeyoung Cha,
- Marie-Francine Moens,
- Marc Najork
Copyright © 2025 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 10 March 2025
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
WSDM '25: The Eighteenth ACM International Conference on Web Search and Data Mining
March 10 - 14, 2025
Hannover, Germany
Acceptance Rates
Overall Acceptance Rate 498 of 2,863 submissions, 17%
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025