Estimating Node Importance in Knowledge Graphs Using Graph Neural Networks
원문 초록
How can we estimate the importance of nodes in a knowledge graph (KG)? A KG is a multi-relational graph that has proven valuable for many tasks including question answering and semantic search. In this paper, we present GENI, a method for tackling the problem of estimating node importance in KGs, which enables several downstream applications such as item recommendation and resource allocation. While a number of approaches have been developed to address this problem for general graphs, they do not fully utilize information available in KGs, or lack flexibility needed to model complex relationship between entities and their importance. To address these limitations, we explore supervised machine learning algorithms. In particular, building upon recent advancement of graph neural networks (GNNs), we develop GENI, a GNN-based method designed to deal with distinctive challenges involved with predicting node importance in KGs. Our method performs an aggregation of importance scores instead of aggregating node embeddings via predicate-aware attention mechanism and flexible centrality adjustment. In our evaluation of GENI and existing methods on predicting node importance in real-world KGs with different characteristics, GENI achieves 5-17% higher NDCG@100 than the state of the art.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Learning Efficient and Generalizable Graph Retriever for Knowledge-Graph Question Answering
Large Language Models Meet Knowledge Graphs for Question Answering: Synthesis and Opportunities
Inference Scaled GraphRAG: Improving Multi Hop Question Answering on Knowledge Graphs
iQUEST: An Iterative Question-Guided Framework for Knowledge Base Question Answering
DGRAG: Distributed Graph-based Retrieval-Augmented Generation in Edge-Cloud Systems
DO-RAG: A Domain-Specific QA Framework Using Knowledge Graph-Enhanced Retrieval-Augmented Generation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.