Universal Knowledge Graph Embeddings
A variety of knowledge graph embedding approaches have been developed. Most of them obtain embeddings by learning the structure of the knowledge graph within a link prediction setting. As a result, the embeddings reflect only the structure of a single knowledge graph, and embeddings for different knowledge graphs are not aligned, e.g., they cannot be used to find similar entities across knowledge graphs via nearest neighbor search. However, knowledge graph embedding applications such as entity disambiguation require a more global representation, i.e., a representation that is valid across multiple sources. We propose to learn universal knowledge graph embeddings from large-scale interlinked knowledge sources. To this end, we fuse large knowledge graphs based on the owl:sameAs relation such that every entity is represented by a unique identity. We instantiate our idea by computing universal embeddings based on DBpedia and Wikidata yielding embeddings for about 180 million entities, 15 thousand relations, and 1.2 billion triples. We believe our computed embeddings will support the emerging field of graph foundation models. Moreover, we develop a convenient API to provide embeddings as a service. Experiments on link prediction suggest that universal knowledge graph embeddings encode better semantics compared to embeddings computed on a single knowledge graph. For reproducibility purposes, we provide our source code and datasets open access.
Code (1)
Tasks
Entity DisambiguationGraph EmbeddingKnowledge Graph EmbeddingKnowledge Graph EmbeddingsKnowledge GraphsLink PredictionvalidMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Entity-Agnostic Representation Learning for Parameter-Efficient Knowledge Graph Embedding
We propose an entity-agnostic representation learning method for handling the problem of inefficient parameter storage costs brought by embedding knowledge graphs. Conventional knowledge graph embedding methods map eleme…
Entity EmbeddingsGraph EmbeddingKnowledge Graph EmbeddingKnowledge Graphs+2Universal Preprocessing Operators for Embedding Knowledge Graphs with Literals
Knowledge graph embeddings are dense numerical representations of entities in a knowledge graph (KG). While the majority of approaches concentrate only on relational information, i.e., relations between entities, fewer a…
Knowledge Graph EmbeddingsKnowledge GraphsPanRep: Graph neural networks for extracting universal node embeddings in heterogeneous graphs
Learning unsupervised node embeddings facilitates several downstream tasks such as node classification and link prediction. A node embedding is universal if it is designed to be used by and benefit various downstream tas…
Graph Neural NetworkLink PredictionNode ClassificationPanRep: Universal node embeddings for heterogeneous graphs
Learning unsupervised node embeddings facilitates several downstream tasks such as node classification and link prediction. A node embedding is universal if it is designed to be used by and benefit various downstream tas…
Graph Neural NetworkLink PredictionNode ClassificationLearning Universal Graph Neural Network Embeddings With Aid Of Transfer Learning
Learning powerful data embeddings has become a center piece in machine learning, especially in natural language processing and computer vision domains. The crux of these embeddings is that they are pretrained on huge cor…
DecoderGraph ClassificationGraph EmbeddingGraph Learning+2