Graph Enhanced BERT for Query Understanding
Graph Enhanced BERT for Query Understanding
复制标题
DOI:
10.1145/3539618.3591845
复制
发表时间:
2022-04
期刊:
影响因子:
--
通讯作者:
Juanhui Li;Yao Ma;Weizhen Zeng;Suqi Cheng;Jiliang Tang;Shuaiqiang Wang;Dawei Yin
中科院分区:
文献类型:
--
作者:
Juanhui Li;Yao Ma;Weizhen Zeng;Suqi Cheng;Jiliang Tang;Shuaiqiang Wang;Dawei Yin
Query understanding plays a key role in exploring users' search intents and facilitating users to locate their most desired information. However, it is inherently challenging since it needs to capture semantic information from short and ambiguous queries and often requires massive task-specific labeled data. In recent years, pre-trained language models (PLMs) have advanced various natural language processing tasks because they can extract general semantic information from large-scale corpora. However, directly applying them to query understanding is sub-optimal because existing strategies rarely consider to boost the search performance. On the other hand, search logs contain user clicks between queries and urls that provide rich users' search behavioral information on queries beyond their content. Therefore, in this paper, we aim to fill this gap by exploring search logs. In particular, we propose a novel graph-enhanced pre-training framework, GE-BERT, which leverages both query content and the query graph. The model is trained on a query graph where nodes are queries and two queries are connected if they lead to clicks on the same urls, to capture both semantic information and users' search behavioral information of queries. Extensive experiments on offline and online tasks have demonstrated the effectiveness of the proposed framework.