arXiv Machine Learning

Hidden relationships in a document-derived property graph: top-k chunk embeddings and inverse-distance weighting over a dynamically evolving ontology

The paper introduces a second-pass method for uncovering hidden relationships in knowledge graphs extracted from text, without altering the original facts. By chunking documents and embedding each chunk once, the approach uses top‑k nearest‑neighbor queries and Shepard inverse‑distance weighting to score candidate node pairs, avoiding threshold issues inherent in cosine scoring. The technique is order‑independent, scalable, and has been implemented across multiple graph databases, demonstrating high edge fidelity with lower‑dimensional embeddings and a 25× speedup in top‑k computation.

arXiv AI
Sep 15

FedV-KGQA in Practice: Design Lessons and an Interactive Prototype

FedV-KGQA addresses multi‑hop question answering over vertically partitioned knowledge graphs where each silo holds disjoint relation types. The system trains local embeddings, concatenates silo‑specific entity views, anchors questions at a topic entity, and ranks candidates without sharing raw triples. Experiments show federated fusion nearly matches centralized accuracy, that anchoring and enrichment are more critical than embedding choice, and that the cheapest encoder depends on target accuracy.

By Md Saikat Islam Khan Bappy, Oshani Seneviratne
arXiv Computation and Language
Aug 25

ConvergeWriter: Data-Driven Bottom-Up Article Construction

ConvergeWriter introduces a bottom‑up, data‑driven framework for long‑form document generation that first retrieves exhaustive knowledge from a source corpus and clusters it into distinct knowledge groups. These clusters then guide the creation of a hierarchical outline and the final text, ensuring the output is strictly grounded in the retrieved material and traceable to its sources. Experiments on 14B and 32B LLMs show that this approach matches or surpasses state‑of‑the‑art baselines, especially in scenarios requiring high factual fidelity and structural coherence.

By Binquan Ji, Jiaqi Wang, Ruiting Li, Xingchen Han, Yiyang Qi, Shichao Wang, Yifei Lu, Yuantao Han, Feiliang Ren
arXiv Machine Learning
Aug 6

Neighborhood-Aware Dual Biomedical Entity Linking

arXiv:2608. 04144v1 Announce Type: cross Abstract: Biomedical entity linking grounds mentions in clinical and scientific text to entities in a curated knowledge base (KB) with ontological structure, which supports downstream applications such as literature-scale information extraction and patient-record normalization.

By Yicheng Tao, Jie Liu
arXiv Computation and Language
Sep 18

CORTEX: High-Quality Cross-Domain Organization of Web-Scale Corpora through Ontological Corpus Graph

CORTEX is a novel framework that transforms web‑scale corpus construction from flat document filtering into structured knowledge organization using an Ontological Corpus Graph (OCG). The OCG comprises a quality‑refined content layer, a lightweight ontology layer that evolves via LLMs, and a cross‑domain alignment layer that supports arbitrary taxonomic resolution. Experiments demonstrate CORTEX’s effectiveness, and the authors release a 24.14 B‑token refined corpus, its OCG, and a cross‑domain benchmark called CortexBench for evaluating large language models.

By Chengtao Gan, Xiaoke Guo, Yushan Zhu, Zhaoyan Gong, Zhiqiang Liu, Songze Li, Huajun Chen, Wen Zhang
arXiv Computation and Language
Sep 7

CAGE: Coherence-Aware Graph Encoding for Retrieval-Augmented Generation

CAGE: Coherence-Aware Graph Encoding for Retrieval-Augmented Generation introduces a reranking framework that evaluates and enhances the coherence of retrieved passages across four dimensions—Intra-Domain Relevance, Noise Resistance, Informational Bonding, and Factual Consistency. The method transforms passages into directed heterogeneous entity graphs, reweights factual anchors, encodes structural patterns with a Relational Graph Convolutional Network, and fuses inter-chunk coherence with query relevance to produce a final ranking. Evaluations on four multi‑hop benchmarks show that CAGE matches or surpasses strong baselines, improving Recall@5 on bridge‑dominated datasets and consistently boosting downstream Exact Match scores, indicating that structurally coherent context leads to more precise answers even when retrieval recall is similar or lower.

By Tong Qi, Jingyu Wu, Youbing Yin, Spencer Hong, Daben Liu, Erin Babinsky
arXiv AI
3d ago

Bridging Semantics and Structure: A Theoretically Grounded Framework for Link Prediction on TAGs

Bridge-LP is a new framework for link prediction on text‑attributed graphs that combines Graph Neural Networks and Language Models. It introduces three design components: jumping connections for robust language model training, compressed embeddings to encode neighborhood information, and a cache embedding strategy to reduce computational cost. Experiments on nine datasets show that Bridge‑LP outperforms 40 existing models, achieving up to a 43.06% improvement in Mean Reciprocal Rank.

By Chen Shao, Ruirui Wang, Tobias Kafer, Danai Koutra
arXiv AI
Jun 3

ReaLM: Residual Quantization Bridging Knowledge Graph Embeddings and Large Language Models

arXiv:2510. 09711v2 Announce Type: replace-cross Abstract: Large Language Models (LLMs) have recently emerged as a powerful paradigm for Knowledge Graph Completion (KGC), offering strong reasoning and generalization capabilities beyond traditional embedding-based approaches.

By Wenbin Guo, Xin Wang, Jiaoyan Chen, Lingbing Guo, Zhao Li, Zirui Chen
arXiv AI
Jun 17

A Unified Framework for Context-Aware and Relation-Aware Graph Retrieval-Augmented Generation

arXiv:2606. 18075v1 Announce Type: new Abstract: Retrieval-Augmented Generation (RAG) has emerged as a paradigm for enhancing large language models (LLMs) with external knowledge, yet existing graph-based methods face a fundamental limitation: entity-centric and chunk-centric approaches operate on representations anchored to original text without true knowledge fusion.

By Haoyang Zhong, Yifei Sun, Antong Zhang, Chunping Wang, Lei Chen, Yang Yang