EDBT 2026 Demo / reviewers in the wild / expert
Bowen Li 0012
dblp:75/10470-12
· DBLP profile ↗
5ranked-venue papers
0as first author
5since 2021 · last 2026
0009-0007-6470-5607ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 4 · 4 since 2021Applied, interdisciplinary, general and emerging computing · 4 · 4 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Spiking Graph Predictive Coding for Reliable OOD Generalization
Jing Ren 0001, Jiapeng Du, Bowen Li 0012, Ziqi Xu 0001, Xin Zheng 0008, Hong Jia, Suyu Ma, Xiwei Xu 0001, Feng Xia 0001 |
WWW | 3 |
| 2026 | When to Invoke: Refining LLM Fairness with Toxicity Assessment
Jing Ren 0001, Bowen Li 0012, Ziqi Xu 0001, Renqiang Luo, Shuo Yu 0001, Xin Ye 0004, Haytham M. Fayek, Xiaodong Li 0001, Feng Xia 0001 |
WWW | 2 |
| 2026 | When to Trust: A Causality-Aware Calibration Framework for Accurate Knowledge Graph Retrieval-Augmented GenerationabstractKnowledge Graph Retrieval-Augmented Generation (KG-RAG) extends the RAG paradigm by incorporating structured knowledge from knowledge graphs, enabling Large Language Models (LLMs) to perform more precise and explainable reasoning. While KG-RAG improves factual accuracy in complex tasks, existing KG-RAG models are often severely overconfident, producing high-confidence predictions even when retrieved sub-graphs are incomplete or unreliable, which raises concerns for deployment in high-stakes domains. To address this issue, we propose Ca2KG, a Causality-aware Calibration framework for KG-RAG. Ca2KG integrates counterfactual prompting, which exposes retrieval-dependent uncertainties in knowledge quality and reasoning reliability, with a panel-based re-scoring mechanism that stabilises predictions across interventions. Extensive experiments on two complex QA datasets demonstrate that Ca2KG consistently improves calibration while maintaining or even enhancing predictive accuracy. The source code can be found at~ https://aisuko.github.io/ca2kg/. Jing Ren 0001, Bowen Li 0012, Ziqi Xu 0001, Xikun Zhang 0002, Haytham M. Fayek, Xiaodong Li 0001 |
WWW | 2 |
| 2026 | Causal Prompting for Implicit Sentiment Analysis With Large Language ModelsabstractImplicit sentiment analysis (ISA) aims to infer sentiment that is implied rather than explicitly stated, requiring models to perform deeper reasoning over subtle contextual cues. While recent prompting-based methods using large language models (LLMs) have shown promise in ISA, they often rely on majority voting over chain-of-thought (CoT) reasoning paths without evaluating their causal validity, making them susceptible to internal biases and spurious correlations. To address this challenge, we propose CAPITAL, a causal prompting framework that incorporates front-door adjustment into CoT reasoning. CAPITAL decomposes the overall causal effect into two components: the influence of the input prompt on the reasoning chains, and the impact of those chains on the final output. These components are estimated using encoder-based clustering and the NWGM approximation, with a contrastive learning objective used to better align the encoder’s representation with the LLM’s reasoning space. Experiments on benchmark ISA datasets with three LLMs demonstrate that CAPITAL consistently outperforms strong prompting baselines in both accuracy and robustness, particularly under adversarial conditions. This work offers a principled approach to integrating causal inference into LLM prompting and highlights its benefits for bias-aware sentiment reasoning. The source code and case study are available at:https://github.com/whZ62/CAPITAL. Jing Ren 0001, Bowen Li 0012, Mujie Liu, Nguyen Linh Dan Le, Jiade Cen, Ziqi Xu 0001, Xiwei Xu 0001, Xiaodong Li 0001 |
IEEE Trans. Comput. Soc. Syst. | 3 |
| 2026 | Graph2text or Graph2token: A Perspective of Large Language Models for Graph LearningabstractGraphs are prevalent in numerous real-world applications. Previous methods directly model graph structures and achieve significant success. However, these methods encounter bottlenecks due to the inherent irregularity of graphs. An innovative solution is converting graphs into textual representations, thereby harnessing the powerful capabilities of Large Language Models (LLMs) to process and comprehend graphs. In this article, we present a comprehensive review of methodologies for applying LLMs to graphs, termed LLM4graph. The core of LLM4graph lies in transforming graphs into texts for LLMs to understand and analyze. Thus, we propose a novel taxonomy of LLM4graph methods from the view of the transformation. Specifically, existing methods can be divided into two paradigms: Graph2text and Graph2token, which transform graphs into texts or tokens as the input of LLMs, respectively. We point out four challenges during the transformation to systematically present existing methods from a problem-oriented perspective. For practical concerns, we provide a guideline for researchers on selecting appropriate models and LLMs for different graphs and hardware constraints. To empirically evaluate our taxonomy and different technical choices, we conduct experiments with representative methods in Graph2text and Graph2token. We also identify five future research directions for LLM4graph. Shuo Yu 0001, Ruolin Li, Guchun Liu, Yanming Shen, Shaoxiong Ji, Bowen Li 0012, Fengling Han, Xiuzhen Zhang 0001, Feng Xia 0001 |
ACM Trans. Inf. Syst. | 7 |