{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/a-graph-enhanced-click-model-for-web-search-1","title":"A Graph-Enhanced Click Model for Web Search","arxiv_id":"2206.08621","date":"2022-06-17","proceeding":"Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval 2021 7","authors":["Jianghao Lin","Weiwen Liu","Xinyi Dai","Weinan Zhang","Shuai Li","Ruiming Tang","Xiuqiang He","Jianye Hao","Yong Yu"],"abstract":"To better exploit search logs and model users' behavior patterns, numerous click models are proposed to extract users' implicit interaction feedback. Most traditional click models are based on the probabilistic graphical model (PGM) framework, which requires manually designed dependencies and may oversimplify user behaviors. Recently, methods based on neural networks are proposed to improve the prediction accuracy of user behaviors by enhancing the expressive ability and allowing flexible dependencies. However, they still suffer from the data sparsity and cold-start problems. In this paper, we propose a novel graph-enhanced click model (GraphCM) for web search. Firstly, we regard each query or document as a vertex, and propose novel homogeneous graph construction methods for queries and documents respectively, to fully exploit both intra-session and inter-session information for the sparsity and cold-start problems. Secondly, following the examination hypothesis, we separately model the attractiveness estimator and examination predictor to output the attractiveness scores and examination probabilities, where graph neural networks and neighbor interaction techniques are applied to extract the auxiliary information encoded in the pre-constructed homogeneous graphs. Finally, we apply combination functions to integrate examination probabilities and attractiveness scores into click predictions. Extensive experiments conducted on three real-world session datasets show that GraphCM not only outperforms the state-of-art models, but also achieves superior performance in addressing the data sparsity and cold-start problems.","url_abs":"https://arxiv.org/abs/2206.08621v2","url_pdf":"https://arxiv.org/pdf/2206.08621v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"a-graph-enhanced-click-model-for-web-search-1","repo_url":"https://github.com/chiangel/graphcm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"graph-construction","task_name":"graph construction"},{"task_slug":"model","task_name":"model"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2206.08621","atlas_url":"https://app.syntology.ai/?focus=2206.08621","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08621"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/chiangel/graphcm","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":3,"unverified":1},"by_repo_kind":{"official":{"samples":4,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"84be3313cd158cbb","entry":"generate_data_per_query","repo":"chiangel/graphcm","repo_kind":"official","path":"utils.py","file_url":"https://github.com/chiangel/graphcm/blob/HEAD/utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"84be3313cd158cbb"}},{"code_sha256_prefix":"208a02b672a7e3e3","entry":"load_dict","repo":"chiangel/graphcm","repo_kind":"official","path":"utils.py","file_url":"https://github.com/chiangel/graphcm/blob/HEAD/utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"208a02b672a7e3e3"}},{"code_sha256_prefix":"dd308f8a6981ae0a","entry":"load_list","repo":"chiangel/graphcm","repo_kind":"official","path":"utils.py","file_url":"https://github.com/chiangel/graphcm/blob/HEAD/utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"dd308f8a6981ae0a"}},{"code_sha256_prefix":"379c71e530a5f40e","entry":"generate_dataset_for_cold_start","repo":"chiangel/graphcm","repo_kind":"official","path":"data_preprocess/TREC2014.py","file_url":"https://github.com/chiangel/graphcm/blob/HEAD/data_preprocess/TREC2014.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"379c71e530a5f40e"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}