18 citations · 38 across the 8 of their papers we have counts for
5 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 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…