3 papers
cs.DS2026
A Tour of Locality Sensitive Filtering on the Sphere
Luca Becchetti, Andrea Clementi, Luciano Gualà +3
The Approximate Near Neighbor (ANN) problem is a cornerstone of high-dimensional data analysis. While Locality Sensitive Hashing (LSH) has been the classical paradigm, recent work…
cs.DS2025
Approximate -hop neighborhoods on incremental graphs: An efficient lazy approach
Luca Becchetti, Andrea Clementi, Luciano Gualà +3
In this work, we propose, analyze and empirically validate a lazy-update approach to maintain accurate approximations of the -hop neighborhoods of dynamic graphs resulting from…
cs.DS2024
Maintaining -MinHash Signatures over Fully-Dynamic Data Streams with Recovery
Andrea Clementi, Luciano Gualà, Luca Pepè Sciarria +1
We consider the task of performing Jaccard similarity queries over a large collection of items that are dynamically updated according to a streaming input model. An item here is a…