In the paper, we analyze two alternative random walk strategies for RDF2vec, and show that they can be used to create embedding spaces in which the distance function encodes a different semantic property, i.e., similarity or relatedness, respectively, while the embedding space of classic RDF2vec mixes both properties.
The paper is available on arxiv.