LLM-Based Knowledge Graph Completion Combining Discrete Structural Coding with Similar Entity Information
Knowledge graph completion requires models to use both textual descriptions and relational structure. Existing LLM-based methods either encode KG structure as discrete tokens or refine a restricted set of candidate entities, and these two directions have largely been studied separately. We propose CoSC for LLM-based KGC, which combines discrete structural coding with similar entity information. Specifically, an LLM generates an initial candidate entity ranking from discrete structural codes, after which information from entities with structures similar to that of the query entity refines the ranking. Experiments on FB15k-237 show that CoSC outperforms existing baselines on MRR and Hits@10 while remaining competitive on Hits@1.
Code (0)
등록된 구현이 없습니다.
Tasks
Knowledge Graph CompletionSimilar Papers 제목 키워드 기반
GS-Quant: Granular Semantic and Generative Structural Quantization for Knowledge Graph Completion
Large Language Models (LLMs) have shown immense potential in Knowledge Graph Completion (KGC), yet bridging the modality gap between continuous graph embeddings and discrete LLM tokens remains a critical challenge. While…
Knowledge Graph CompletionNeural, Symbolic and Neural-Symbolic Reasoning on Knowledge Graphs
Knowledge graph reasoning is the fundamental component to support machine learning applications such as information extraction, information retrieval, and recommendation. Since knowledge graphs can be viewed as the discr…
Information RetrievalKnowledge Graph CompletionKnowledge GraphsQuestion Answering+2Dual-Path LLM Reasoning for Multimodal Few-Shot Knowledge Graph Completion
Knowledge graph completion (KGC) aims to infer missing facts in knowledge graphs (KGs), thereby improving their completeness and supporting downstream intelligent applications. However, emerging entities and relations in…
Knowledge Graph CompletionKnowledge GraphsATAP: Automatic Template-Augmented Commonsense Knowledge Graph Completion via Pre-Trained Language Models
The mission of commonsense knowledge graph completion (CKGC) is to infer missing facts from known commonsense knowledge. CKGC methods can be roughly divided into two categories: triple-based methods and text-based method…
Knowledge Graph CompletionCommonsense Knowledge Base Completion with Structural and Semantic Context
Automatic KB completion for commonsense knowledge graphs (e.g., ATOMIC and ConceptNet) poses unique challenges compared to the much studied conventional knowledge bases (e.g., Freebase). Commonsense knowledge graphs use …
Computational EfficiencyKnowledge Base CompletionKnowledge GraphsLanguage Modelling+2