no code implementations • 15 Feb 2023 • Jérôme Kunegis, Pawan Kumar, Jun Sun, Anna Samoilenko, Giuseppe Pirró
In this paper we take the problem of visualising large graphs from a novel perspective: we leave the original graph's nodes and edges behind, and instead summarise its properties such as the clustering coefficient and bipartivity by generating a completely new graph whose structural properties match that of the original graph.
no code implementations • 28 May 2019 • Valeria Fionda, Giuseppe Pirró
We show that directly applying existing embedding techniques on the nodes of the line graph to learn edge embeddings is not enough in the context of knowledge graphs.