Walk this Way! Entity Walks and Property Walks for RDF2vec
Jan Portisch, Heiko Paulheim
Abstract
RDF2vec is a knowledge graph embedding mechanism which first extracts sequences from knowledge graphs by performing random walks, then feeds those into the word embedding algorithm word2vec for computing vector representations for entities. In this poster, we introduce two new flavors of walk extraction coined e-walks and p-walks, which put an emphasis on the structure or the neighborhood of an entity respectively, and thereby allow for creating embeddings which focus on similarity or relatedness. By combining the walk strategies with order-aware and classic RDF2vec, as well as CBOW and skip-gram word2vec embeddings, we conduct a preliminary evaluation with a total of 12 RDF2vec variants.
Related Papers
SMART: Relation-Aware Learning of Geometric Representations for Knowledge Graphs2025-07-17Topic Modeling and Link-Prediction for Material Property Discovery2025-07-08Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs2025-07-05Context-Driven Knowledge Graph Completion with Semantic-Aware Relational Message Passing2025-06-29Active Inference AI Systems for Scientific Discovery2025-06-26Enhancing LLM Tool Use with High-quality Instruction Data from Knowledge Graph2025-06-26Generating Reliable Adverse event Profiles for Health through Automated Integrated Data (GRAPH-AID): A Semi-Automated Ontology Building Approach2025-06-25Inference Scaled GraphRAG: Improving Multi Hop Question Answering on Knowledge Graphs2025-06-24