289 citations · 577 across the 17 of their papers we have counts for
18 papers
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…
Autonomous microARPES
Steinn Ymir Agustsson, Alfred J. H. Jones, Davide Curcio +5
Angle-resolved photoemission spectroscopy (ARPES) is a technique used to map the occupied electronic structure of solids. Recent progress in X-ray focusing optics has led to the de…
Optimally Interpolating between Ex-Ante Fairness and Welfare
Mikael Møller Høgsgaard, Panagiotis Karras, Wenyue Ma +2
For the fundamental problem of allocating a set of resources among individuals with varied preferences, the quality of an allocation relates to the degree of fairness and the colle…
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…
DANES: Deep Neural Network Ensemble Architecture for Social and Textual Context-aware Fake News Detection
Ciprian-Octavian Truică, Elena-Simona Apostol, Panagiotis Karras
The growing popularity of social media platforms has simplified the creation and distribution of news articles but also creates a conduit for spreading fake news. In consequence, t…
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…
Maximizing the Probability of Fixation in the Positional Voter Model
Petros Petsinis, Andreas Pavlogiannis, Panagiotis Karras
The Voter model is a well-studied stochastic process that models the invasion of a novel trait (e.g., a new opinion, social meme, genetic mutation, magnetic spin) in a network…
Invasion Dynamics in the Biased Voter Process
Loke Durocher, Panagiotis Karras, Andreas Pavlogiannis +1
The voter process is a classic stochastic process that models the invasion of a mutant trait (e.g., a new opinion, belief, legend, genetic mutation, magnetic spin) in a populat…
Atrapos: Real-time Evaluation of Metapath Query Workloads
Serafeim Chatzopoulos, Thanasis Vergoulis, Dimitrios Skoutas +3
Heterogeneous information networks (HINs) represent different types of entities and relationships between them. Exploring, analysing, and extracting knowledge from such networks re…
Fixation Maximization in the Positional Moran Process
Joachim Brendborg, Panagiotis Karras, Andreas Pavlogiannis +2
The Moran process is a classic stochastic process that models invasion dynamics on graphs. A single "mutant" (e.g., a new opinion, strain, social trait etc.) invades a population o…
GRASP: Graph Alignment through Spectral Signatures
Judith Hermanns, Anton Tsitsulin, Marina Munkhoeva +3
What is the best way to match the nodes of two graphs? This graph alignment problem generalizes graph isomorphism and arises in applications from social network analysis to bioinfo…
FREDE: Anytime Graph Embeddings
Anton Tsitsulin, Marina Munkhoeva, Davide Mottin +3
Low-dimensional representations, or embeddings, of a graph's nodes facilitate several practical data science and data engineering tasks. As such embeddings rely, explicitly or impl…
The Shape of Data: Intrinsic Distance for Data Distributions
Anton Tsitsulin, Marina Munkhoeva, Davide Mottin +4
The ability to represent and compare machine learning models is crucial in order to quantify subtle model changes, evaluate generative models, and gather insights on neural network…
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…
Publishing Microdata with a Robust Privacy Guarantee
Jianneng Cao, Panagiotis Karras
Today, the publication of microdata poses a privacy threat. Vast research has striven to define the privacy condition that microdata should satisfy before it is released, and devis…
Stochastic Database Cracking: Towards Robust Adaptive Indexing in Main-Memory Column-Stores
Felix Halim, Stratos Idreos, Panagiotis Karras +1
Modern business applications and scientific databases call for inherently dynamic data storage environments. Such environments are characterized by two challenging features: (a) th…