arXiv Machine Learning

Two-dimensional Taxonomy for N-ary Knowledge Representation Learning Methods

arXiv AI

Jul 10

MetaHGNIE: Meta-Path Induced Hypergraph Contrastive Learning in Heterogeneous Knowledge Graphs

arXiv:2512. 12477v2 Announce Type: replace Abstract: Estimating node importance in heterogeneous knowledge graphs is a fundamental problem underlying recommendation, search, and knowledge decision systems.

By Jiawen Chen, Yanyan He, Qi Shao, Mengli Wei, Duxin Chen, Wenwu Yu, Yanlong Zhao

llms rag benchmarks safety

arXiv AI

Jun 16

Model Graph Inductive Learning for Knowledge Graph Completion

arXiv:2606. 16509v1 Announce Type: new Abstract: Link prediction in knowledge graphs fundamentally depends on the quality of learned embeddings for entities and relations.

By Mohommad Esmaei Khani, Mahdieh Hasheminejad, Ali Taherkhani, Hossein Hajiabolhassan

rag benchmarks

arXiv AI

Oct 15

QORH: Learning Query-Specific Ordered Rule Hypergraphs for Inductive Knowledge Graph Link Prediction

arXiv:2610.18198v1 Announce Type: new Abstract: Knowledge graph link prediction involving unseen entities and relations requires learning transferable reasoning patterns from observed graph structure...

By Naixing Xu

benchmarks

arXiv AI

Oct 5

KGPFN: Unlocking the Potential of Knowledge Graph Foundation Model via In-Context Learning

arXiv:2605.14907v2 Announce Type: replace Abstract: Knowledge graph (KG) foundation models aim to generalize to graphs with unseen entities and relations by learning transferable relational structure...

By Yisen Gao, Jiaxin Bai, Haoyu Huang, Zhongwei Xie, Yufei Li, Hong Ting Tsang, Sirui Han, Yangqiu Song

llms fine-tuning

arXiv AI

Jul 17

DualHNIE: Dual-Channel Hypergraph Learning for Node Importance Estimation in Heterogeneous Knowledge Graphs

arXiv:2512. 12477v3 Announce Type: replace Abstract: Estimating node importance in heterogeneous knowledge graphs is a fundamental problem underlying recommendation, search, and knowledge decision systems.

By Jiawen Chen, Yanyan He, Qi Shao, Mengli Wei, Duxin Chen, Wenwu Yu, Yanlong Zhao

llms rag benchmarks safety

arXiv AI

Jun 15

Knowledge Graph Enhanced Memory-Augmented Retrieval for Long Context Modeling

arXiv:2606. 14047v1 Announce Type: cross Abstract: Long-context language modeling requires not only extending context windows but maintaining coherent understanding of entity states and relationships across thousands of tokens -- a challenge that semantic similarity alone cannot address.

By Ghadir Alselwi, Basem Suleiman, Hao Xue, Shoaib Jameel, Hakim Hacid, Flora D. Salim, Imran Razzak

llms rag

arXiv AI

Jun 19

Implicit Semantic-Aware Communication Based on Hypergraph Reasoning

arXiv:2606. 20162v1 Announce Type: new Abstract: Semantic-aware communication has emerged as a transformative paradigm for next-generation communication systems, shifting the fundamental goal from transmitting bit-level symbols to reliably recovering and understanding the semantic meaning of information.

By Yiwei Liao, Shurui Tu, Yong Xiao, Yingyu Li, Guangming Shi

rag benchmarks

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

llms rag nlp efficiency benchmarks

arXiv AI

Jul 14

Knowledge Graphs Meet Graph Neural Networks: A Comprehensive Survey

arXiv:2607. 09666v1 Announce Type: cross Abstract: Graph Neural Networks (GNNs) have emerged as a powerful paradigm in Knowledge Graphs (KGs) due to their intrinsic ability to model graph-structured data.

By Chengcheng Sun, Jiayun Tian, Cheng Zhai, Zhixiao Wang, Yajie Song, Xiaobin Rui, Jian Zhang, Philip S. Yu

rag

arXiv AI

Sep 3

PEARL: Path-Entity Aligned Relational Learning with Contextual Subgraphs for Inductive Knowledge Graph Completion

PEARL is a new framework for inductive knowledge graph completion that treats relational paths as context-conditioned reasoning signals. It builds a query‑specific contextual subgraph from the query entities’ neighborhoods and uses a large language model‑guided retriever to select semantically relevant paths. By constructing a bipartite interaction graph over paths, contextual entities, and a global subgraph representation, and applying a dual‑view contrastive objective, PEARL adapts path embeddings to local and global structural evidence, achieving the best average Hits@10 on WN18RR, FB15k‑237, and NELL‑995.

By Yunchi Yang, Longlong Li, Cunquan Qu

llms rag benchmarks

arXiv AI

Sep 4

Pattern Over-Generalization of Knowledge Graph Embedding

arXiv:2609. 03487v1 Announce Type: cross Abstract: Knowledge graph embedding (KGE) demonstrates its effectiveness for predicting missing links in knowledge graphs (KGs) by projecting entities and relations into a low-dimensional vector space.

By Junsik Kim, Kangil Kim

rag benchmarks

arXiv AI

Jun 29

RelBall: Relation Ball with Quaternion Rotation for Knowledge Graph Completion

arXiv:2606. 27967v1 Announce Type: new Abstract: Real-world knowledge graphs are often incomplete, lacking many valid facts.

By Yike Liu, Peijia Xie, Chao He, Huiling Zhu

Related stories