RDF2Vec: RDF Graph Embeddings and Their Applications

Linked Open Data has been recognized as a valuable source for background information in many data mining and information retrieval tasks. However, most of the existing tools require features in propositional form, i.e., a vector of nominal or numerical features associated with an instance, while Linked Open Data sources are graphs by nature. In this paper, we present RDF2Vec, an approach that uses language modeling approaches for unsupervised feature extraction from sequences of words, and adapts them to RDF graphs.We generate sequences by leveraging local information from graph sub-structures, harvested by Weisfeiler-Lehman Subtree RDF Graph Kernels and graph walks, and learn latent numerical representations of entities in RDF graphs.We evaluate our approach on three different tasks: (i) standard machine learning tasks, (ii) entity and document modeling, and (iii) content-based recommender systems. The evaluation shows that the proposed entity embeddings outperform existing techniques, and that pre-computed feature vector representations of general knowledge graphs such as DBpedia and Wikidata can be easily reused for different tasks.

PDF Abstract


Results from the Paper

Task Dataset Model Metric Name Metric Value Global Rank Benchmark
Node Classification AIFB RDF2Vec+SVM Accuracy 88.88 # 4
Node Classification AM RDF2Vec+SVM Accuracy 88.33 # 3
Node Classification BGS RDF2Vec+SVM Accuracy 87.24 # 1
Node Classification MUTAG RDF2Vec+SVM Accuracy 67.20 # 4


No methods listed for this paper. Add relevant methods here