VEM 2 L: An easy but effective framework for fusing text and structure knowledge on sparse knowledge graph completion

Publication Type

Journal Article

Publication Date

1-2024

Abstract

The task of Knowledge Graph Completion (KGC) is to infer missing links for Knowledge Graphs (KGs) by analyzing graph structures. However, with increasing sparsity in KGs, this task becomes increasingly challenging. In this paper, we propose VEM2L, a joint learning framework that incorporates structure and relevant text information to supplement insufcient features for sparse KGs. We begin by training two pre-existing KGC models: one based on structure and the other based on text. Our ultimate goal is to fuse knowledge acquired by these models. To achieve this, we divide knowledge within the models into two non-overlapping parts: expressive power and generalization ability. We then propose two diferent joint learning methods that co-distill these two kinds of knowledge respectively. For expressive power, we allow each model to learn from and exchange knowledge mutually on training examples. For the generalization ability, we propose a novel co-distillation strategy using the Variational EM algorithm on unobserved queries. Our proposed joint learning framework is supported by both detailed theoretical evidence and qualitative experiments, demonstrating its efectiveness.

Keywords

Centralized optimization, data-driven optimization, distributed optimization, evolutionary computation, privacy protection

Discipline

Databases and Information Systems

Research Areas

Data Science and Engineering

Publication

Data Mining and Knowledge Discovery

First Page

1

Last Page

29

ISSN

1384-5810

Identifier

10.1007/s10618-023-01001-y

Publisher

Springer

Copyright Owner and License

Authors

Additional URL

https://doi.org/10.1007/s10618-023-01001-y

This document is currently not available here.

Share

COinS