59 citations · 79 across the 10 of their papers we have counts for
6 papers · 1 filter
ReliK: A Reliability Measure for Knowledge Graph Embeddings
Maximilian K. Egger, Wenyue Ma, Davide Mottin +4
Can we assess a priori how well a knowledge graph embedding will perform on a specific downstream task and in a specific part of the knowledge graph? Knowledge graph embeddings (KG…
MCWDST: a Minimum-Cost Weighted Directed Spanning Tree Algorithm for Real-Time Fake News Mitigation in Social Media
Ciprian-Octavian Truică, Elena-Simona Apostol, Radu-Cătălin Nicolescu +1
The widespread availability of internet access and handheld devices confers to social media a power similar to the one newspapers used to have. People seek affordable information o…
Spectral Graph Complexity
Anton Tsitsulin, Davide Mottin, Panagiotis Karras +2
We introduce a spectral notion of graph complexity derived from the Weyl's law. We experimentally demonstrate its correlation to how well the graph can be embedded in a low-dimensi…
SGR: Self-Supervised Spectral Graph Representation Learning
Anton Tsitsulin, Davide Mottin, Panagiotis Karras +2
Representing a graph as a vector is a challenging task; ideally, the representation should be easily computable and conducive to efficient comparisons among graphs, tailored to the…
NetLSD: Hearing the Shape of a Graph
Anton Tsitsulin, Davide Mottin, Panagiotis Karras +2
Comparison among graphs is ubiquitous in graph analytics. However, it is a hard task in terms of the expressiveness of the employed similarity measure and the efficiency of its com…
VERSE: Versatile Graph Embeddings from Similarity Measures
Anton Tsitsulin, Davide Mottin, Panagiotis Karras +1
Embedding a web-scale information network into a low-dimensional vector space facilitates tasks such as link prediction, classification, and visualization. Past research has addres…