Qinggang Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Qinggang Zhang has a total of 53 co-authors. Here are the top co-authors by number of shared publications:
- Xiao Huang
The Hong Kong Polytechnic University, Hong Kong, Hong Kong
14 shared publications - Junnan Dong
The Hong Kong Polytechnic University, Hung Hom, Hong Kong
7 shared publications - Huachi Zhou
The Hong Kong Polytechnic University, Hong Kong, Hong Kong
5 shared publications - Hao Chen
Faculty of Data Science, City University of Macau, Macao SAR, China
4 shared publications - Feiran Huang
Beihang University
3 shared publications - Luyao Zhuang
The Hong Kong Polytechnic University, Hong Kong, Hong Kong
3 shared publications
Latest Publications
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 5407-5418
MemGraphRAG: Memory-based Multi-Agent System for Graph Retrieval-Augmented Generation
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 5407-5418
Open AccessMemGraphRAG: Memory-based Multi-Agent System for Graph Retrieval-Augmented Generation
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1710-1721
E rror LLM: Modeling SQL Errors for Text-to-SQL Refinement
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1710-1721
Open AccessE rror LLM: Modeling SQL Errors for Text-to-SQL Refinement
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 13044-13055
ReLU: Refined Chunk Embeddings Learning for Ultra-long SNP Genomic Prediction in Crop Breeding
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 13044-13055
Open AccessReLU: Refined Chunk Embeddings Learning for Ultra-long SNP Genomic Prediction in Crop Breeding
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 4800-4804
Bridging the Topology-Semantic Gap: A Benchmark and Framework for Power Grid Work Ticket Generation
Retrieval-Augmented Generation (RAG) is a promising paradigm for domain-specific knowledge integration. However, applying generic RAG frameworks to power grid operation and maintenance (O&M) faces critical challenges due to the strict physical constraints of electrical networks. We identify a fundamental Topological Association Modeling Deficiency in existing methods, manifesting as Retrieval Linkage Degradation (where semantic ambiguity severs links between abstract intents and specific technical entities) and Topological Reasoning Deficiency (failing to adhere to rigid physical interlocking rules, causing fatal safety violations). To address these bottlenecks, we introduce the Power Grid Work Ticket (PGWT) dataset to systematically evaluate topological reasoning under real-world noise and sparsity. Furthermore, we propose Topology-Semantic Aligned Retrieval (TSA-Retrieval). This framework harmonizes semantic spaces with topological structures by fusing symbolic pattern matching with subgraph structural encoding to ensure physical validity, while explicitly injecting topology-aware reasoning chains to guide constraint-compliant generation. Extensive experiments demonstrate that TSA-Retrieval significantly outperforms state-of-the-art LLMs and generic RAG baselines, offering a robust and scalable solution for safety-critical applications.
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 4800-4804
Open AccessBridging the Topology-Semantic Gap: A Benchmark and Framework for Power Grid Work Ticket Generation
Retrieval-Augmented Generation (RAG) is a promising paradigm for domain-specific knowledge integration. However, applying generic RAG frameworks to power grid operation and maintenance (O&M) faces critical challenges due to the strict physical constraints of electrical networks. We identify a fundamental Topological Association Modeling Deficiency in existing methods, manifesting as Retrieval Linkage Degradation (where semantic ambiguity severs links between abstract intents and specific technical entities) and Topological Reasoning Deficiency (failing to adhere to rigid physical interlocking rules, causing fatal safety violations). To address these bottlenecks, we introduce the Power Grid Work Ticket (PGWT) dataset to systematically evaluate topological reasoning under real-world noise and sparsity. Furthermore, we propose Topology-Semantic Aligned Retrieval (TSA-Retrieval). This framework harmonizes semantic spaces with topological structures by fusing symbolic pattern matching with subgraph structural encoding to ensure physical validity, while explicitly injecting topology-aware reasoning chains to guide constraint-compliant generation. Extensive experiments demonstrate that TSA-Retrieval significantly outperforms state-of-the-art LLMs and generic RAG baselines, offering a robust and scalable solution for safety-critical applications.
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 3835-3846
LoSemB: Logic-Guided Semantic Bridging for Inductive Tool Retrieval
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 3835-3846
Open AccessLoSemB: Logic-Guided Semantic Bridging for Inductive Tool Retrieval
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2296-2307
Facilitating Generative Retrieval with Logical Denoising for Interpretable Conversational Search
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2296-2307
Open AccessFacilitating Generative Retrieval with Logical Denoising for Interpretable Conversational Search
- Top Cited Papers
- 22 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (4) , 2380-2393
Reliable Reasoning Path: Distilling Effective Guidance for LLM Reasoning With Knowledge Graphs
Large language models (LLMs) often struggle with knowledge-intensive tasks due to a lack of background knowledge and a tendency to hallucinate. To address these limitations, integrating knowledge graphs (KGs) with LLMs has been intensively studied. Existing KG-enhanced LLMs focus on supplementary factual knowledge, but still struggle with solving complex questions. We argue that refining the relationships among facts and organizing them into a logically consistent reasoning path is equally important as factual knowledge itself. Despite their potential, extracting reliable reasoning paths from KGs poses the following challenges: the complexity of graph structures and the existence of multiple generated paths, making it difficult to distinguish between useful and redundant ones. To tackle these challenges, we propose the RRP framework to mine the knowledge graph, which combines the semantic strengths of LLMs with structural information obtained through relation embedding and bidirectional distribution learning. Additionally, we introduce a rethinking module that evaluates and refines reasoning paths according to their significance. Experimental results on two public datasets show that RRP achieves state-of-the-art performance compared to existing baseline methods. Moreover, RRP can be easily integrated into various LLMs to enhance their reasoning abilities in a plug-and-play manner. By generating high-quality reasoning paths tailored to specific questions, RRP distills effective guidance for LLM reasoning.
- 22 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (4) , 2380-2393
Top Cited PapersReliable Reasoning Path: Distilling Effective Guidance for LLM Reasoning With Knowledge Graphs
Large language models (LLMs) often struggle with knowledge-intensive tasks due to a lack of background knowledge and a tendency to hallucinate. To address these limitations, integrating knowledge graphs (KGs) with LLMs has been intensively studied. Existing KG-enhanced LLMs focus on supplementary factual knowledge, but still struggle with solving complex questions. We argue that refining the relationships among facts and organizing them into a logically consistent reasoning path is equally important as factual knowledge itself. Despite their potential, extracting reliable reasoning paths from KGs poses the following challenges: the complexity of graph structures and the existence of multiple generated paths, making it difficult to distinguish between useful and redundant ones. To tackle these challenges, we propose the RRP framework to mine the knowledge graph, which combines the semantic strengths of LLMs with structural information obtained through relation embedding and bidirectional distribution learning. Additionally, we introduce a rethinking module that evaluates and refines reasoning paths according to their significance. Experimental results on two public datasets show that RRP achieves state-of-the-art performance compared to existing baseline methods. Moreover, RRP can be easily integrated into various LLMs to enhance their reasoning abilities in a plug-and-play manner. By generating high-quality reasoning paths tailored to specific questions, RRP distills effective guidance for LLM reasoning.
- Top Cited Papers
- 12 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (12) , 7328-7345
Next-Generation Database Interfaces: A Survey of LLM-Based Text-to-SQL
Generating accurate SQL from users’ natural language questions (text-to-SQL) remains a long-standing challenge due to the complexities involved in user question understanding, database schema comprehension, and SQL generation. Traditional text-to-SQL systems, which combine human engineering and deep neural networks, have made significant progress. Subsequently, pre-trained language models (PLMs) have been developed for text-to-SQL tasks, achieving promising results. However, as modern databases and user questions grow more complex, PLMs with a limited parameter size often produce incorrect SQL. This necessitates more sophisticated and tailored optimization methods, which restrict the application of PLM-based systems. Recently, large language models (LLMs) have shown significant capabilities in natural language understanding as model scale increases. Thus, integrating LLM-based solutions can bring unique opportunities, improvements, and solutions to text-to-SQL research. In this survey, we provide a comprehensive review of existing LLM-based text-to-SQL studies. Specifically, we offer a brief overview of the technical challenges and evolutionary process of text-to-SQL. Next, we introduce the datasets and metrics designed to evaluate text-to-SQL systems. Subsequently, we present a systematic analysis of recent advances in LLM-based text-to-SQL. Finally, we make a summary and discuss the remaining challenges in this field and suggest expectations for future research directions.
- 12 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (12) , 7328-7345
Top Cited PapersNext-Generation Database Interfaces: A Survey of LLM-Based Text-to-SQL
Generating accurate SQL from users’ natural language questions (text-to-SQL) remains a long-standing challenge due to the complexities involved in user question understanding, database schema comprehension, and SQL generation. Traditional text-to-SQL systems, which combine human engineering and deep neural networks, have made significant progress. Subsequently, pre-trained language models (PLMs) have been developed for text-to-SQL tasks, achieving promising results. However, as modern databases and user questions grow more complex, PLMs with a limited parameter size often produce incorrect SQL. This necessitates more sophisticated and tailored optimization methods, which restrict the application of PLM-based systems. Recently, large language models (LLMs) have shown significant capabilities in natural language understanding as model scale increases. Thus, integrating LLM-based solutions can bring unique opportunities, improvements, and solutions to text-to-SQL research. In this survey, we provide a comprehensive review of existing LLM-based text-to-SQL studies. Specifically, we offer a brief overview of the technical challenges and evolutionary process of text-to-SQL. Next, we introduce the datasets and metrics designed to evaluate text-to-SQL systems. Subsequently, we present a systematic analysis of recent advances in LLM-based text-to-SQL. Finally, we make a summary and discuss the remaining challenges in this field and suggest expectations for future research directions.
- Open Access
- 26 August 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
Self-Monitoring Large Language Models for Click-Through Rate Prediction
Click-through rate prediction tasks estimate interaction probabilities using user-item features (i.e., the combined set of user and item features). LLMs have emerged as a promising approach by organizing these features into prompts and fine-tuning LLMs to predict the interaction label. However, our feature-wise and interaction-wise analysis reveals two critical limitations, leading to incomplete relationship modeling between user-item features and interaction labels: (i) LLMs tend to utilize only a subset of available features, neglecting others, and (ii) they struggle with predictions for tail items that appear less frequently in the training samples. To bridge this gap, we propose F eature- I nstructed L arge language model for M onitoring ( FILM ), which introduces a self-monitoring temperature mechanism that dynamically guides LLMs to focus on informative features, and an auxiliary compaction loss that facilitates better feature-interaction relationship learning for tail items. By integrating these two designs, FILM not only improves feature utilization in LLMs but also enhances predictions for tail items. Furthermore, we demonstrate that FILM -generated interaction embeddings can be transferred to lightweight models, enabling efficient deployment. Extensive experiments demonstrate that FILM achieves significant performance improvements over state-of-the-art baselines by learning better relationships between user-item features and interaction labels and generalizes under different LLM backbones.
- 26 August 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
Open AccessSelf-Monitoring Large Language Models for Click-Through Rate Prediction
Click-through rate prediction tasks estimate interaction probabilities using user-item features (i.e., the combined set of user and item features). LLMs have emerged as a promising approach by organizing these features into prompts and fine-tuning LLMs to predict the interaction label. However, our feature-wise and interaction-wise analysis reveals two critical limitations, leading to incomplete relationship modeling between user-item features and interaction labels: (i) LLMs tend to utilize only a subset of available features, neglecting others, and (ii) they struggle with predictions for tail items that appear less frequently in the training samples. To bridge this gap, we propose F eature- I nstructed L arge language model for M onitoring ( FILM ), which introduces a self-monitoring temperature mechanism that dynamically guides LLMs to focus on informative features, and an auxiliary compaction loss that facilitates better feature-interaction relationship learning for tail items. By integrating these two designs, FILM not only improves feature utilization in LLMs but also enhances predictions for tail items. Furthermore, we demonstrate that FILM -generated interaction embeddings can be transferred to lightweight models, enabling efficient deployment. Extensive experiments demonstrate that FILM achieves significant performance improvements over state-of-the-art baselines by learning better relationships between user-item features and interaction labels and generalizes under different LLM backbones.
- Open Access
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 4268-4277
Logical Reasoning with Relation Network for Inductive Knowledge Graph Completion
Inductive knowledge graph completion (KGC) aims to infer the missing relation for a set of newly-coming entities that never appeared in the training set. Such a setting is more in line with reality, as real-world KGs are constantly evolving and introducing new knowledge. Recent studies have shown promising results using message passing over subgraphs to embed newly-coming entities for inductive KGC. However, the inductive capability of these methods is usually limited by two key issues. (i) KGC always suffers from data sparsity, and the situation is even exacerbated in inductive KGC where new entities often have few or no connections to the original KG. (ii) Cold-start problem. It is over coarse-grained for accurate KG reasoning to generate representations for new entities by gathering the local information from few neighbors. To this end, we propose a novel iNfOmax RelAtion Network, namely NORAN, for inductive KG completion. It aims to mine latent relation patterns for inductive KG completion. Specifically, by centering on relations, NORAN provides a hyper view towards KG modeling, where the correlations between relations can be naturally captured as entity-independent logical evidence to conduct inductive KGC. Extensive experiment results on five benchmarks show that our framework substantially outperforms the state-of-the-art KGC methods.
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 4268-4277
Open AccessLogical Reasoning with Relation Network for Inductive Knowledge Graph Completion
Inductive knowledge graph completion (KGC) aims to infer the missing relation for a set of newly-coming entities that never appeared in the training set. Such a setting is more in line with reality, as real-world KGs are constantly evolving and introducing new knowledge. Recent studies have shown promising results using message passing over subgraphs to embed newly-coming entities for inductive KGC. However, the inductive capability of these methods is usually limited by two key issues. (i) KGC always suffers from data sparsity, and the situation is even exacerbated in inductive KGC where new entities often have few or no connections to the original KG. (ii) Cold-start problem. It is over coarse-grained for accurate KG reasoning to generate representations for new entities by gathering the local information from few neighbors. To this end, we propose a novel iNfOmax RelAtion Network, namely NORAN, for inductive KG completion. It aims to mine latent relation patterns for inductive KG completion. Specifically, by centering on relations, NORAN provides a hyper view towards KG modeling, where the correlations between relations can be naturally captured as entity-independent logical evidence to conduct inductive KGC. Extensive experiment results on five benchmarks show that our framework substantially outperforms the state-of-the-art KGC methods.