5 citations · 5 across the 4 of their papers we have counts for
4 papers · 1 filter
Scalable and Distributed Silhouette Approximation
Ilie Sarpe, Federico Altieri, Andrea Pietracaprina +2
The silhouette is one of the most widely used measures to assess the quality of a -clustering of a dataset of elements. Its evaluation requires no information beyond the clu…
Efficient Approximate Temporal Triangle Counting in Streaming with Predictions
Giorgio Venturin, Ilie Sarpe, Fabio Vandin
Triangle counting is a fundamental and widely studied problem on static graphs, and recently on temporal graphs, where edges carry information on the timings of the associated even…
Fast and Accurate Triangle Counting in Graph Streams Using Predictions
Cristian Boldrin, Fabio Vandin
In this work, we present the first efficient and practical algorithm for estimating the number of triangles in a graph stream using predictions. Our algorithm combines waiting room…
Scalable Temporal Motif Densest Subnetwork Discovery
Ilie Sarpe, Fabio Vandin, Aristides Gionis
Finding dense subnetworks, with density based on edges or more complex structures, such as subgraphs or -cliques, is a fundamental algorithmic problem with many applications. Wh…