Demo Data from EDBT 2026 / reviewers in the wild / expert
Kun Wan 0008
dblp:421/2597
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0001-8081-6450ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Language models and text generation · 67% Knowledge representation and reasoning · 33% | |
| Databases, data mining, and information retrieval
1 paper |
Recommender systems · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational finance and economics · 100% |
Topics — the 4 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation
large language model fine-tuning |
1.0 | 1 | 2026 | Chat2Trade: Automating Financial RFQ Parsing with Fine-Tuned LLMs · KDD (1) 2026 |
Natural language and speech › Language models and text generation
retrieval-augmented generation |
1.0 | 1 | 2026 | Chat2Trade: Automating Financial RFQ Parsing with Fine-Tuned LLMs · KDD (1) 2026 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge acquisition › knowledge extraction
structured information extraction |
1.0 | 1 | 2026 | Chat2Trade: Automating Financial RFQ Parsing with Fine-Tuned LLMs · KDD (1) 2026 |
Recommender systems
explainable recommendation |
0.9 | 1 | 2025 | ConciseExplain: Reducing Redundancy and Spuriousness in Persuasive Recommendation Explanation · KDD (2) 2025 |
Methods — techniques the papers use, named apart from their topics
fine-tuned large language model · 2.0few-shot retrieval · 2.0mask training · 0.9gradient descent · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Chat2Trade: Automating Financial RFQ Parsing with Fine-Tuned LLMsabstractThe trading volume of China's secondary bond market reached CNY 2,735.44 trillion in 2024. The majority of transactions were conducted through the over-the-counter (OTC) market. In this market, brokers, buyers, and sellers send request-for-quote (RFQ) messages via group or private chats, generating an RFQ pool containing tens of thousands of requests. Brokers search through this pool to match suitable counterparties and facilitate transactions between them. The faster they match, the more trading opportunities and profits they can obtain. However, as RFQs are unstructured text messages, manual matching is time-consuming. Therefore, we built a system to accelerate this process. The core task of this system is to automatically parse RFQs into structured data, which faces two key challenges: highly domain-specific jargon in RFQs and the rapid evolution of jargon patterns. To address these challenges, we propose an RFQ parsing method based on fine-tuned large language models (LLMs). It consists of three sequential components: (1) Message Chunking, which decomposes an RFQ message into shorter items; (2) Few-shot Retrieval, which retrieves similar historical RFQs; and (3) Record Extraction, which generates structured RFQ records leveraging retrieved demonstrations. Compared with baseline methods, this approach delivers significant performance gains and exhibits superior adaptability to novel expressions. Building on this methodology, we developed Chat2Trade, a trading assistance system that parses RFQs and supports rapid filtering and querying. Chat2Trade transforms the brokers' traditional workflow from actively searching for relevant RFQs into a passive, real-time, push-based paradigm. The system has been deployed at China Securities, one of the largest securities firms in China, for nearly one year. It improves brokers' average trading volume by 3.67 times compared to traditional manual methods. Yixuan Cao 0001, Chunhao Yang, Kun Wan 0008, Ping Luo 0001 |
KDD (1) | 5 |
| 2025 | ConciseExplain: Reducing Redundancy and Spuriousness in Persuasive Recommendation ExplanationabstractRecommendation systems are effective tools for information filtering and discovery. These systems are widely applied across various consumer sectors and hold significant potential for applications in professional domains to enhance work efficiency. However, supporting decision-making in professional contexts requires not only providing recommendation results but also offering explanations to persuade users to adopt the suggestions. Taking the task in the primary bond market as an example, where sales staff seek potential investors for bonds, this paper presents the development and deployment of a recommendation system designed for a professional setting. The system provides a set of key features as explanations for its recommendations. In this process, we observe that current explanation methods may select redundant and spurious features, which can undermine the persuasive impact of the explanations. To address this issue, we propose a method named ConciseExplain, which leverages a mask training strategy and gradient descent to directly identify a concise set of features. We conduct experiments on real-world and synthetic datasets. Our method achieves relative improvements of 6.1% and 12.4% over the best-performing baseline on redundant and spurious metrics, respectively. Our method also outperforms the baseline method in online manual evaluations. Moreover, during the one-year official deployment of our system at China Securities Co., Ltd. (a leading brokerage firm in China), we observed a continuous improvement in the accuracy of the recommendation system. This suggests that, with concise explanations, a positive feedback loop might be established between recommendation outcomes and investment decisions. Yixuan Cao 0001, Juyao Liu, Kun Wan 0008, Ping Luo 0001 |
KDD (2) | 5 |