paper-with-me

Papers

Pseudo-Knowledge Graph: Meta-Path Guided Retrieval and In-Graph Text for RAG-Equipped LLM

2025-03-01 · Yuxin Yang, Haoyang Wu, Tao Wang, Jia Yang, Hao Ma, Guojie Luo

The advent of Large Language Models (LLMs) has revolutionized natural language processing. However, these models face challenges in retrieving precise information from vast datasets. Retrieval-Augmented Generation (RAG) was developed to combining LLMs with external information retrieval systems to enhance the accuracy and context of responses. Despite improvements, RAG still struggles with comprehensive retrieval in high-volume, low-information-density databases and lacks relational awareness, leading to fragmented answers. To address this, this paper introduces the Pseudo-Knowledge Graph (PKG) framework, designed to overcome these limitations by integrating Meta-path Retrieval, In-graph Text and Vector Retrieval into LLMs. By preserving natural language text and leveraging various retrieval techniques, the PKG offers a richer knowledge representation and improves accuracy in information retrieval. Extensive evaluations using Open Compass and MultiHop-RAG benchmarks demonstrate the framework's effectiveness in managing large volumes of data and complex relationships.

📄 PDF Abstract BibTeX arXiv:2503.00309

Code (0)

등록된 구현이 없습니다.

Tasks

Information RetrievalRAGRetrievalRetrieval-augmented Generation

Methods 이 논문이 사용한 방법론

Refunds@Expedia|||How do I get a full refund from Expedia? “How do I get a full refund from Expedia? How do I get a full refund from Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Quick Help &…
Attention 설명 없음
BPE Byte Pair Encoding, or BPE, is a subword segmentation algorithm that encodes rare and unknown words as sequences of subword units. The intuition is that various word…
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Linear Warmup With Linear Decay Linear Warmup With Linear Decay is a learning rate schedule in which we increase the learning rate linearly for $n$ updates and then linearly decay afterwards.
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
BART BART is a denoising autoencoder for pretraining sequence-to-sequence models. It is trained by (1) corrupting text…
Layer Normalization Unlike batch normalization, Layer Normalization directly estimates the normalization statistics from the summed inputs…

Similar Papers 제목 키워드 기반

Metapaths guided Neighbors aggregated Network for?Heterogeneous Graph Reasoning

2021-03-11 · Bang Lin, Xiuchong Wang, Yu Dong, Chengfu Huo 외

Most real-world datasets are inherently heterogeneous graphs, which involve a diversity of node and relation types. Heterogeneous graph embedding is to learn the structure and semantic information from the graph, and the…

DiversityGraph EmbeddingGraph Neural NetworkLink Prediction+2

FHGE: A Fast Heterogeneous Graph Embedding with Ad-hoc Meta-paths

2025-02-22 · Xuqi Mao, Zhenying He, X. Sean Wang

Graph neural networks (GNNs) have emerged as the state of the art for a variety of graph-related tasks and have been widely used in Heterogeneous Graphs (HetGs), where meta-paths help encode specific semantics between va…

Graph EmbeddingLink PredictionNode Classification

Ontology-Guided Evidence Path Inference for Multi-hop Knowledge Graph Question Answering

2026-06-26 · Yongxue Shan, Meihan Wu, Cundi Fang, Jie Peng 외 arxiv

Knowledge graph question answering (KGQA) aims to answer natural-language questions by reasoning over structured facts. Existing multi-hop KGQA methods mainly rely on topic-centered expansion, which faces two key challen…

Graph Question Answering

Feature Learning for Meta-Paths in Knowledge Graphs

2018-09-07 · Sebastian Bischoff

In this thesis, we study the problem of feature learning on heterogeneous knowledge graphs. These features can be used to perform tasks such as link prediction, classification and clustering on graphs. Knowledge graphs p…

ClusteringGraph EmbeddingKnowledge GraphsLink Prediction

Meta-node: A Concise Approach to Effectively Learn Complex Relationships in Heterogeneous Graphs

2022-10-26 · Jiwoong Park, Jisu Jeong, KyungMin Kim, Jin Young Choi

Existing message passing neural networks for heterogeneous graphs rely on the concepts of meta-paths or meta-graphs due to the intrinsic nature of heterogeneous graphs. However, the meta-paths and meta-graphs need to be …

Contrastive LearningGraph LearningNode Clustering