DeepAI AI Chat
Log In Sign Up

Towards Exploiting Implicit Human Feedback for Improving RDF2vec Embeddings

by   Ahmad Al Taweel, et al.
University of Mannheim

RDF2vec is a technique for creating vector space embeddings from an RDF knowledge graph, i.e., representing each entity in the graph as a vector. It first creates sequences of nodes by performing random walks on the graph. In a second step, those sequences are processed by the word2vec algorithm for creating the actual embeddings. In this paper, we explore the use of external edge weights for guiding the random walks. As edge weights, transition probabilities between pages in Wikipedia are used as a proxy for the human feedback for the importance of an edge. We show that in some scenarios, RDF2vec utilizing those transition probabilities can outperform both RDF2vec based on random walks as well as the usage of graph internal edge weights.


page 1

page 2

page 3

page 4


Walk this Way! Entity Walks and Property Walks for RDF2vec

RDF2vec is a knowledge graph embedding mechanism which first extracts se...

Random walks on randomly evolving graphs

A random walk is a basic stochastic process on graphs and a key primitiv...

Random Walks on Hypergraphs with Edge-Dependent Vertex Weights

Hypergraphs are used in machine learning to model higher-order relations...

Not all Embeddings are created Equal: Extracting Entity-specific Substructures for RDF Graph Embedding

Knowledge Graphs (KGs) are becoming essential to information systems tha...

A Graph-Based Platform for Customer Behavior Analysis using Applications' Clickstream Data

Clickstream analysis is getting more attention since the increase of usa...

Weisfeiler–Leman, Graph Spectra, and Random Walks

The Weisfeiler–Leman algorithm is a ubiquitous tool for the Graph Isomor...

The Pendulum Arrangement: Maximizing the Escape Time of Heterogeneous Random Walks

We identify a fundamental phenomenon of heterogeneous one dimensional ra...