Xiadan Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xiadan Chen has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Ellen Anne Huang
Department of Computer Science, Western University, London, Ontario, Canada
1 shared publication - Fengjing Zhang
Hangzhou Dianzi University, China
1 shared publication - Jimmy Xiangji Huang
Information Retrieval and Knowledge Management Research Lab, York University
1 shared publication - Junmei Wang
Hangzhou Dianzi University, China
1 shared publication - Puyu He
Hangzhou Dianzi University, China
1 shared publication
Latest Publications
- Open Access
- 25 June 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
Utilizing Large Language Model for Conversational Information Seeking via Dual-Query Generation and Joint-Encoding
Conversational retrieval leverages multi-turn conversations to meet users’ information needs, and accurately understanding the new intent has become a significant challenge in this field. Recently, the language comprehension and reasoning capabilities of large language models offer a viable solution to these challenges. In this paper, we propose a new Dual-Query Generation and Joint-Encoding method by utilizing Large Language Model for Conversational Information Seeking, abbreviated as DQ-CIS. Specifically, we propose a dual-query generation approach that leverages both open-source and closed-source large language models (LLMs) to generate two complementary queries: a full-rewrite query that preserves the context semantics of the conversation and a condensed-rewrite query that emphasizes the core intent of the current query. Additionally, to better express the semantic information of the query, we propose a dual-query joint-encoding method, which enhances the thematic expression of query vectors by treating the dual-query as semantic complementary. A query coverage fine-tuned semantic matching method is also introduced to improve result relevance and ranking by fine-tuning the original retrieval scores by ColBERT. We conducted a number of experiments on seven publicly available conversational retrieval datasets. The results show that compared with other models, DQ-CIS has strong competitiveness in both retrieval efficiency and retrieval results.
- 25 June 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
Open AccessUtilizing Large Language Model for Conversational Information Seeking via Dual-Query Generation and Joint-Encoding
Conversational retrieval leverages multi-turn conversations to meet users’ information needs, and accurately understanding the new intent has become a significant challenge in this field. Recently, the language comprehension and reasoning capabilities of large language models offer a viable solution to these challenges. In this paper, we propose a new Dual-Query Generation and Joint-Encoding method by utilizing Large Language Model for Conversational Information Seeking, abbreviated as DQ-CIS. Specifically, we propose a dual-query generation approach that leverages both open-source and closed-source large language models (LLMs) to generate two complementary queries: a full-rewrite query that preserves the context semantics of the conversation and a condensed-rewrite query that emphasizes the core intent of the current query. Additionally, to better express the semantic information of the query, we propose a dual-query joint-encoding method, which enhances the thematic expression of query vectors by treating the dual-query as semantic complementary. A query coverage fine-tuned semantic matching method is also introduced to improve result relevance and ranking by fine-tuning the original retrieval scores by ColBERT. We conducted a number of experiments on seven publicly available conversational retrieval datasets. The results show that compared with other models, DQ-CIS has strong competitiveness in both retrieval efficiency and retrieval results.