Generative Adversarial Zero-Shot Relational Learning for Knowledge Graphs
원문 초록
Large-scale knowledge graphs (KGs) are shown to become more important in current information systems. To expand the coverage of KGs, previous studies on knowledge graph completion need to collect adequate training instances for newly-added relations. In this paper, we consider a novel formulation, zero-shot learning, to free this cumbersome curation. For newly-added relations, we attempt to learn their semantic features from their text descriptions and hence recognize the facts of unseen relations with no examples being seen. For this purpose, we leverage Generative Adversarial Networks (GANs) to establish the connection between text and knowledge graph domain: The generator learns to generate the reasonable relation embeddings merely with noisy text descriptions. Under this setting, zero-shot learning is naturally converted to a traditional supervised classification task. Empirically, our method is model-agnostic that could be potentially applied to any version of KG embeddings, and consistently yields performance improvements on NELL and Wiki dataset.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Knowledge Graph Embedding via Graph Attenuated Attention Networks
Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs
GenIC: An LLM-Based Framework for Instance Completion in Knowledge Graphs
ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion
Knowledge Graph Completion with Mixed Geometry Tensor Factorization
Context-Driven Knowledge Graph Completion with Semantic-Aware Relational Message Passing
토론
이 논문과 연결된 포럼 글이 아직 없습니다.