Knowledge graphs

A Hogan, E Blomqvist, M Cochez, C d'Amato… - ACM Computing …, 2021 - dl.acm.org
In this article, we provide a comprehensive introduction to knowledge graphs, which have
recently garnered significant attention from both industry and academia in scenarios that …

RDF2Vec: RDF graph embeddings and their applications

P Ristoski, J Rosati, T Di Noia, R De Leone… - Semantic …, 2019 - content.iospress.com
Abstract 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 …

Drug-drug interaction prediction based on knowledge graph embeddings and convolutional-LSTM network

MR Karim, M Cochez, JB Jares, M Uddin… - Proceedings of the 10th …, 2019 - dl.acm.org
Interference between pharmacological substances can cause serious medical injuries.
Correctly predicting so-called drug-drug interactions (DDI) does not only reduce these cases …

C-SAW: A framework for graph sampling and random walk on GPUs

S Pandey, L Li, A Hoisie, XS Li… - … Conference for High …, 2020 - ieeexplore.ieee.org
Many applications require to learn, mine, analyze and visualize large-scale graphs. These
graphs are often too large to be addressed efficiently using conventional graph processing …

Global RDF vector space embeddings

M Cochez, P Ristoski, SP Ponzetto… - The Semantic Web–ISWC …, 2017 - Springer
Vector space embeddings have been shown to perform well when using RDF data in data
mining and machine learning tasks. Existing approaches, such as RDF2Vec, use local …

Knightking: a fast distributed graph random walk engine

K Yang, MX Zhang, K Chen, X Ma, Y Bai… - Proceedings of the 27th …, 2019 - dl.acm.org
Random walk on graphs has recently gained immense popularity as a tool for graph data
analytics and machine learning. Currently, random walk algorithms are developed as …

Tea: a general-purpose temporal graph random walk engine

C Huan, SL Song, S Pandey, H Liu, Y Liu… - Proceedings of the …, 2023 - dl.acm.org
Many real-world graphs are temporal in nature, where the temporal information indicates
when a particular edge is changed (eg, edge insertion and deletion). Performing random …

[PDF][PDF] ALOD2Vec matcher.

J Portisch, H Paulheim - OM@ ISWC, 2018 - inrialpes.fr
In this paper, we introduce the ALOD2Vec Matcher, an ontology matching tool that exploits a
Web-scale data set, ie, WebIsA-LOD, as external knowledge source. In order to make use of …

[PDF][PDF] ThunderRW: An in-memory graph random walk engine

S Sun, Y Chen, S Lu, B He, Y Li - 2021 - ink.library.smu.edu.sg
As random walk is a powerful tool in many graph processing, mining and learning
applications, this paper proposes an efficient inmemory random walk engine named …

pyRDF2Vec: A Python Implementation and Extension of RDF2Vec

B Steenwinckel, G Vandewiele, T Agozzino… - European Semantic …, 2023 - Springer
This paper introduces pyRDF2Vec, a Python software package that reimplements the well-
known RDF2Vec algorithm along with several of its extensions. By making the algorithm …