{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,2]],"date-time":"2026-09-02T15:15:56Z","timestamp":1788362156385,"version":"build-2803163510"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"3","funder":[{"name":"Beijing Nova Program, the Natural Science Foundation of China","award":["62572475, 61902209, 62377044"],"award-info":[{"award-number":["62572475, 61902209, 62377044"]}]},{"name":"Beijing Outstanding Young Scientist Program","award":["BJJWZYJH012019100020098"],"award-info":[{"award-number":["BJJWZYJH012019100020098"]}]},{"name":"Intelligent Social Governance Platform"},{"name":"Major Innovation & Planning Interdisciplinary Platform for the \u201cDouble-First Class\u201d Initiative"},{"DOI":"10.13039\/501100004260","name":"Renmin University of China","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004260","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2026,3,31]]},"abstract":"<jats:p>Click modeling constitutes a pivotal area of study within information retrieval, as it provides insights into user search behavior and enables the extraction of valuable implicit relevance feedback from large-scale click logs. However, existing click models often rely on content-agnostic IDs to represent queries and documents. Additionally, they employ context-independent assumptions, such as the examination hypothesis, in modeling click probabilities. As a result, contemporary click models often fall short of capturing the influence of the diverse, multi-modal content found on modern Search Engine Result Pages (SERPs) and the intricate contextual interactions among heterogeneous search results.<\/jats:p>\n                  <jats:p>To address this issue, we propose a novel Dynamic Graph Neural Click Model (DGCM). The proposed model incorporates rich content and context information by jointly representing them as nodes in a dynamic graph and further leverages a dynamic graph attention network to predict users\u2019 clicks at different timesteps. To demonstrate the effectiveness of the DGCM model, we conducted extensive experiments on two large-scale datasets with both content and click information: the public Sogou-SRR dataset and a proprietary dataset collected on the WeChat platform. The experimental results indicate that by capitalizing on the content and context information, DGCM outperforms existing click models in the click prediction and relevance estimation tasks.<\/jats:p>","DOI":"10.1145\/3795515","type":"journal-article","created":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T12:54:07Z","timestamp":1770036847000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Content- and Context-Aware Click Model Based on Dynamic Graph Neural Networks"],"prefix":"10.1145","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0154-9957","authenticated-orcid":false,"given":"Liu","family":"Yang","sequence":"first","affiliation":[{"name":"Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9257-5498","authenticated-orcid":false,"given":"Jiaxin","family":"Mao","sequence":"additional","affiliation":[{"name":"Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-4742-4116","authenticated-orcid":false,"given":"Ziyuan","family":"Zhao","sequence":"additional","affiliation":[{"name":"Search Algorithm Group, WeChat, Tencent, Guangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7328-2278","authenticated-orcid":false,"given":"Qiang","family":"Yan","sequence":"additional","affiliation":[{"name":"Search Algorithm Group, WeChat, Tencent, Guangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,3,9]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883033"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210004"},{"key":"e_1_3_3_4_2","first-page":"193","article-title":"Learning to rank with nonsmooth cost functions","volume":"19","author":"Burges Christopher","year":"2006","unstructured":"Christopher Burges, Robert Ragno, and Quoc Le. 2006. Learning to rank with nonsmooth cost functions. In Advances in Neural Information Processing Systems, Vol. 19 (2006), 193\u2013200.","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"23","key":"e_1_3_3_5_2","first-page":"81","article-title":"From RankNet to LambdaRank to LambdaMART: An overview","volume":"11","author":"Burges Christopher J. C.","year":"2010","unstructured":"Christopher J. C. Burges. 2010. From RankNet to LambdaRank to LambdaMART: An overview. Learning 11, 23-581 (2010), 81.","journal-title":"Learning"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526711"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124351"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371819"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/2988450.2988454"},{"key":"e_1_3_3_10_2","unstructured":"Kyunghyun Cho Bart Van Merri\u00ebnboer Dzmitry Bahdanau and Yoshua Bengio. 2014. On the properties of neural machine translation: Encoder-decoder approaches. arXiv:1409.1259. Retrieved from https:\/\/arxiv.org\/abs\/1409.1259"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341545"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449913"},{"key":"e_1_3_3_13_2","unstructured":"Jacob Devlin Ming-Wei Chang Kenton Lee and Kristina Toutanova. 2018. BERT: Pre-training of deep bidirectional transformers for language understanding. arXiv:1810.04805. Retrieved from https:\/\/arxiv.org\/abs\/1810.04805"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390392"},{"key":"e_1_3_3_15_2","doi-asserted-by":"crossref","unstructured":"Kawin Ethayarajh. 2019. How contextual are contextualized word representations? Comparing the geometry of BERT ELMo and GPT-2 embeddings. arXiv:1909.00512. Retrieved from https:\/\/arxiv.org\/abs\/1909.00512","DOI":"10.18653\/v1\/D19-1006"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526712"},{"key":"e_1_3_3_17_2","first-page":"124","volume-title":"Proceedings of the 2nd ACM International Conference on Web Search and Data Mining","author":"Guo Fan","year":"2009","unstructured":"Fan Guo, Chao Liu, and Yi Min Wang. 2009. Efficient multiple-click models in web search. In Proceedings of the 2nd ACM International Conference on Web Search and Data Mining, 124\u2013131."},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380027"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3130348.3130374"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3130332.3130334"},{"key":"e_1_3_3_23_2","doi-asserted-by":"crossref","unstructured":"Mike Lewis Yinhan Liu Naman Goyal Marjan Ghazvininejad Abdelrahman Mohamed Omer Levy Ves Stoyanov and Luke Zettlemoyer. 2019. Bart: Denoising sequence-to-sequence pre-training for natural language generation translation and comprehension. arXiv:1910.13461. Retrieved from https:\/\/arxiv.org\/abs\/1910.13461","DOI":"10.18653\/v1\/2020.acl-main.703"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462895"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806603"},{"key":"e_1_3_3_26_2","unstructured":"Yinhan Liu Myle Ott Naman Goyal Jingfei Du Mandar Joshi Danqi Chen Omer Levy Mike Lewis Luke Zettlemoyer and Veselin Stoyanov. 2019. Roberta: A robustly optimized BERT pretraining approach. arXiv:1907.11692. Retrieved from https:\/\/arxiv.org\/abs\/1907.11692"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767714"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210060"},{"key":"e_1_3_3_29_2","unstructured":"Fabio Petroni Tim Rockt\u00e4schel Patrick Lewis Anton Bakhtin Yuxiang Wu Alexander H. Miller and Sebastian Riedel. 2019. Language models as knowledge bases? arXiv:1909.01066. Retrieved from https:\/\/arxiv.org\/abs\/1909.01066"},{"key":"e_1_3_3_30_2","first-page":"8748","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Radford Alec","year":"2021","unstructured":"Alec Radford, Jong Wook Kim, Chris Hallacy, Aditya Ramesh, Gabriel Goh, Sandhini Agarwal, Girish Sastry, Amanda Askell, Pamela Mishkin, Jack Clark, et al. 2021. Learning transferable visual models from natural language supervision. In Proceedings of the International Conference on Machine Learning. PMLR, 8748\u20138763."},{"key":"e_1_3_3_31_2","unstructured":"Karen Simonyan and Andrew Zisserman. 2014. Very deep convolutional networks for large-scale image recognition. arXiv:1409.1556. Retrieved from https:\/\/arxiv.org\/abs\/1409.1556"},{"key":"e_1_3_3_32_2","doi-asserted-by":"crossref","unstructured":"Chao Wang Yiqun Liu Meng Wang Ke Zhou Jianyun Nie and Shaoping Ma. 2015. Incorporating non-sequential interactions into click models. In Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval.","DOI":"10.1145\/2766462.2767712"},{"key":"e_1_3_3_33_2","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1145\/2484028.2484036","volume-title":"Proceedings of the 36th International ACM SIGIR Conference on Research and Development in Information Retrieval","author":"Wang Chao","year":"2013","unstructured":"Chao Wang, Yiqun Liu, Min Zhang, Shaoping Ma, Meihong Zheng, Jing Qian, and Kuo Zhang. 2013. Incorporating vertical results into search click models. In Proceedings of the 36th International ACM SIGIR Conference on Research and Development in Information Retrieval, 503\u2013512."},{"key":"e_1_3_3_34_2","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1145\/2488388.2488508","volume-title":"Proceedings of the 22nd International Conference on World Wide Web","author":"Wang Hongning","year":"2013","unstructured":"Hongning Wang, ChengXiang Zhai, Anlei Dong, and Yi Chang. 2013. Content-aware click modeling. In Proceedings of the 22nd International Conference on World Wide Web, 1365\u20131376."},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313562"},{"key":"e_1_3_3_36_2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/2835776.2835824","volume-title":"Proceedings of the 9th ACM International Conference on Web Search and Data Mining","author":"Wang Yue","year":"2016","unstructured":"Yue Wang, Dawei Yin, Luo Jie, Pengyuan Wang, Makoto Yamada, Yi Chang, and Qiaozhu Mei. 2016. Beyond ranking: Optimizing whole-page presentation. In Proceedings of the 9th ACM International Conference on Web Search and Data Mining, 103\u2013112."},{"key":"e_1_3_3_37_2","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1145\/3269206.3271673","volume-title":"Proceedings of the 27th ACM International Conference on Information and Knowledge Management","author":"Zhang Junqi","year":"2018","unstructured":"Junqi Zhang, Yiqun Liu, Shaoping Ma, and Qi Tian. 2018. Relevance estimation with multiple information sources on search engine result pages. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 627\u2013636."},{"key":"e_1_3_3_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449918"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020613"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3795515","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T18:50:20Z","timestamp":1779821420000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3795515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,9]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3,31]]}},"alternative-id":["10.1145\/3795515"],"URL":"https:\/\/doi.org\/10.1145\/3795515","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,9]]},"assertion":[{"value":"2024-11-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-01-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-03-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}