18 citations · 38 across the 8 of their papers we have counts for
9 papers
Exact power indices for plurality-voting ensembles
Ilie Sarpe, Theofanis Georgakopoulos, Aristides Gionis
Plurality-voting ensembles aggregate the predictions of multiple base classifiers and output the most voted class, with ties typically broken at random. Despite the simple aggregat…
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 and Adaptive Estimation of Local Triadic Coefficients
Ilie Sarpe, Aristides Gionis
Characterizing graph properties is fundamental to the analysis and to our understanding of real-world networked systems. The local clustering coefficient, and the more recently int…
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…
Efficient and Practical Approximation Algorithms for Advertising in Content Feeds
Guangyi Zhang, Ilie Sarpe, Aristides Gionis
Content feeds provided by platforms such as X (formerly Twitter) and TikTok are consumed by users on a daily basis. In this paper, we revisit the native advertising problem in cont…
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…
ONBRA: Rigorous Estimation of the Temporal Betweenness Centrality in Temporal Networks
Diego Santoro, Ilie Sarpe
In network analysis, the betweenness centrality of a node informally captures the fraction of shortest paths visiting that node. The computation of the betweenness centrality measu…
odeN: Simultaneous Approximation of Multiple Motif Counts in Large Temporal Networks
Ilie Sarpe, Fabio Vandin
Counting the number of occurrences of small connected subgraphs, called temporal motifs, has become a fundamental primitive for the analysis of temporal networks, whose edges are a…
PRESTO: Simple and Scalable Sampling Techniques for the Rigorous Approximation of Temporal Motif Counts
Ilie Sarpe, Fabio Vandin
The identification and counting of small graph patterns, called network motifs, is a fundamental primitive in the analysis of networks, with application in various domains, from so…