1 citations · 1 across the 3 of their papers we have counts for
4 papers
Incomplete U-Statistics of Equireplicate Designs: Berry-Esseen Bound and Efficient Construction
Cesare Miglioli, Jordan Awan
U-statistics are a fundamental class of estimators that generalize the sample mean and underpin much of nonparametric statistics. Although extensively studied in both statistics an…
ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations
Maciej Besta, Cesare Miglioli, Paolo Sylos Labini +11
Important graph mining problems such as Clustering are computationally demanding. To significantly accelerate these problems, we propose ProbGraph: a graph representation that enab…
Motif Prediction with Graph Neural Networks
Maciej Besta, Raphael Grob, Cesare Miglioli +8
Link prediction is one of the central problems in graph mining. However, recent studies highlight the importance of higher-order network analysis, where complex structures called m…
SWAG: A Wrapper Method for Sparse Learning
Roberto Molinari, Gaetan Bakalli, Stéphane Guerrier +4
The majority of machine learning methods and algorithms give high priority to prediction performance which may not always correspond to the priority of the users. In many cases, pr…