RDF2Vec Light -- A Lightweight Approach for Knowledge Graph Embeddings
Knowledge graph embedding approaches represent nodes and edges of graphs as mathematical vectors. Current approaches focus on embedding complete knowledge graphs, i.e. all nodes and edges. This leads to very high computational requirements on large graphs such as DBpedia or Wikidata. However, for most downstream application scenarios, only a small subset of concepts is of actual interest. In this paper, we present RDF2Vec Light, a lightweight embedding approach based on RDF2Vec which generates vectors for only a subset of entities. To that end, RDF2Vec Light only traverses and processes a subgraph of the knowledge graph. Our method allows the application of embeddings of very large knowledge graphs in scenarios where such embeddings were not possible before due to a significantly lower runtime and significantly reduced hardware requirements.
Code (1)
Tasks
Graph EmbeddingKnowledge Graph EmbeddingKnowledge Graph EmbeddingsKnowledge GraphsMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
LightCAKE: A Lightweight Framework for Context-Aware Knowledge Graph Embedding
Knowledge graph embedding (KGE) models learn to project symbolic entities and relations into a continuous vector space based on the observed triplets. However, existing KGE models cannot make a proper trade-off between t…
Graph EmbeddingKnowledge Graph EmbeddingKnowledge GraphsApproximating Probabilistic Inference in Statistical EL with Knowledge Graph Embeddings
Statistical information is ubiquitous but drawing valid conclusions from it is prohibitively hard. We explain how knowledge graph embeddings can be used to approximate probabilistic inference efficiently using the exampl…
Knowledge Graph EmbeddingsvalidHyperbolic Geometry is Not Necessary: Lightweight Euclidean-Based Models for Low-Dimensional Knowledge Graph Embeddings
Recent knowledge graph embedding (KGE) models based on hyperbolic geometry have shown great potential in a low-dimensional embedding space. However, the necessity of hyperbolic space in KGE is still questionable, because…
Graph EmbeddingKnowledge Graph EmbeddingKnowledge Graph EmbeddingsLink PredictionLEALLA: Learning Lightweight Language-agnostic Sentence Embeddings with Knowledge Distillation
Large-scale language-agnostic sentence embedding models such as LaBSE (Feng et al., 2022) obtain state-of-the-art performance for parallel sentence alignment. However, these large-scale models can suffer from inference s…
Knowledge DistillationSentenceSentence EmbeddingSentence-Embedding+1Lightweight Inference-Time Personalization for Frozen Knowledge Graph Embeddings
Foundation models for knowledge graphs (KGs) achieve strong cohort-level performance in link prediction, yet fail to capture individual user preferences; a key disconnect between general relational reasoning and personal…
Relational ReasoningGeneral KnowledgeKnowledge GraphsLink Prediction