GraphQAG effectively supports users in identifying knowledge coverage gaps, examining generated QA pairs, and refining the QA pair set through graph-based interactions, demonstrating the usefulness of combining knowledge graphs, LLM-based generation, and visual analytics for producing more comprehensive and trustworthy QA pairs from long documents.
Abstract
Question-answer (QA) pairs are widely used in knowledge base construction, question-answering systems, and the post-training of large language models (LLMs). However, important knowledge in long documents is often distributed across multiple paragraphs and connected through complex entity relationships. Such fragmented and relational knowledge poses substantial challenges for existing QA generation methods, which often fail to adequately cover core document content, cross-paragraph semantic connections, and multi-entity relationships. We present GraphQAG, a knowledge graph-guided visual analytics framework for generating high-quality QA pairs from long documents. GraphQAG follows a three-stage workflow. First, it constructs a document knowledge graph by segmenting the document into paragraphs and extracting salient entities and relations. Second, it builds a graph-based generation space from entities, relations, and multi-hop paths to constrain and guide LLM-based QA generation. Third, it uses the knowledge graph as an interactive visual representation, enabling users to explore document knowledge structures, inspect the coverage and evidence provenance of generated QA pairs, and iteratively refine the QA pair set through graph-based interactions. We evaluated GraphQAG through a user study with 16 participants, two case studies, and expert interviews. The results indicate that GraphQAG effectively supports users in identifying knowledge coverage gaps, examining generated QA pairs, and refining the QA pair set. These findings demonstrate the usefulness of combining knowledge graphs, LLM-based generation, and visual analytics for producing more comprehensive and trustworthy QA pairs from long documents.
Results indicate that integrating multi-source domain knowledge with relation-preserved retrieval and attribute-supported filtering provides more focused and inspectable evidence, thereby supporting more accurate complex material question answering.
Peize Li, Xi Guo, Nan Yin et al.· Electronics· 0 citations
: Knowledge graphs organize real-world facts as structured triples and have become a fundamental resource for search engines, question answering, recommender systems, and knowledge-enhanced large language models. However, real-world knowledge graphs remain highly incomplete, which limits their downstream reasoning ability. Existing pre-trained language model-based knowledge graph completion methods provide strong textual semantic representations, but they usually model graph structure only as shallow auxiliary features and remain weak in distinguishing structurally similar entities and topology-near negative samples. To address this limitation, this paper proposes a Dual-Level Structural Context Collaborative Framework (DSC 2 F) for knowledge graph completion. At the instance level, the framework introduces Structural Neighborhood Context (SNC) to inject local neighborhood evidence into the language model input and Relation-Aware Attention (RAA) to condition structural aggregation on the current relation. At the batch level, it constructs topology-aware training batches with biased random walk with restart, so that in-batch negatives are locally related to positive samples and impose stronger structural discrimination pressure. Experiments on WN18RR, FB15k-237, and Wikidata5M show that DSC 2 F achieves the best mean reciprocal rank and Hits@1 on all three datasets, consistently outperforming strong embedding-based and pre-trained language model-based baselines. Ablation studies and structural configuration analyses further verify that SNC, RAA, and Batch-Level Structural Context provide complementary benefits. These results demonstrate that collaborative modeling of instance-level and batch-level structural context can effectively enhance structure-aware entity representation and improve fine-grained entity prediction.
RA-QGQA is presented, which recasts triple verification as a question-driven, corpus-grounded task, and demonstrates RA-QGQA as an interactive web system in which users import a KG and its source corpus, verify all triples in a single pass, and inspect the passages that justify its verdict.
Siyang Liu, Hong Duc Nguyen, Yun-Miao Li et al.· Proceedings of the 2026 ACM...· 0 citations
Construction standards are critical for building safety and sustainability. Existing standard application workflows rely on keyword-based document retrieval and manual cross-clause interpretation, which cannot reliably support multi-clause reasoning, multimodal knowledge utilization, or traceable clause-level evidence linkage. To address these limitations, this study develops a multimodal knowledge-driven framework that supports question answering on standard knowledge named BEST-KAG (Knowledge-Augmented Generation for Building Engineering STandards). The framework introduces 1) a multimodal knowledge graph (MKG) for unified representation of document hierarchy and heterogeneous standard knowledge with various connections, 2) a rule-LLM hybrid knowledge construction pipeline for scalable multimodal knowledge extraction, creating a large MAG with 251 building engineering standards, 171,652 nodes and 310,914 edges, and 3) a graph-retrieval-based knowledge-augmented generation architecture for clause-grounded and traceable question answering. Experiments demonstrate that BEST-KAG consistently outperforms multiple mainstream LLMs in terms of Expert evaluation, and metrics including BLEU, and ROUGE, with the best improvement up to 74.01% compared to the baselines.
Jia-Rui Lin, Junxi Guo, Ke-Yin Chen et al.· 0 citations
KGCaRe is proposed, a hybrid approach that combines neural retrieval with symbolic reasoning over LLM-generated KGs that consistently outperforms existing baselines, including Vanilla LLM, Code Prompt, Text Prompt, Think-on-Graph, Vanilla RAG, and HybridContextQA.
Ghanshyam Verma, Sima Sarkar, Devishree Pillai et al.· 0 citations
We present EXYGEN (EXplore Your Graphs ENgine), a framework for knowledge graph (KG) understanding that enables conversational access to KGs at scale. We address two questions in sequence. First, how effectively can LLMs perform text-to-SPARQL generation given only automatically derived structured metadata and small graph samples, rather than task-specific fine-tuning? We integrate VoID descriptions and ShEx schemas into a retrieval-augmented generation (RAG) pipeline and ablate KG-derived context on the SciQA benchmark. Our best configuration -- combining ShEx schemas, retrieved triples, and example question-query pairs -- reaches an exact match of 0.419 on execution results without any LLM fine-tuning. We further find that lexical metrics such as F1 poorly predict query correctness, and that larger general-purpose LLMs can outperform smaller code-specialized ones once given sufficient context. Second, we ask how to generate the structured metadata that this method relies on from very large KGs, where KG metadata generation becomes computationally intractable. We introduce a predicate-coverage-aware parallel graph sampling strategy that preserves structural diversity while remaining computationally tractable. On OpenCitations Meta and GESIS, it retains high predicate coverage with minimal triple loss and reduces runtime by over 80x; on ORKG, sampling is not just faster but the only tractable path to obtain complete metadata. Together, these results show that structured schema context and lightweight prompting can substantially reduce reliance on fine-tuning for scalable conversational access to KGs, though closing the remaining gap to fully fine-tuned approaches will likely require reducing dependence on curated question-query exemplars -- whether through synthetic generation or an execution-feedback-driven approach -- and validating these findings beyond a single benchmark.
Harshdeep Singh, Yu-Rui Zhu, Giovanni Colavizza et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
