Set similarity search beyond MinHash

DOI10.1145/3055399.3055443zbMath1370.68067arXiv1612.07710OpenAlexW2574633002MaRDI QIDQ4978050

Rasmus Pagh, Tobias Christiani

Publication date: 17 August 2017

Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.07710

zbMATH Keywords

similarity searchlocality-sensitive hashingMinHashJaccard similarityBraun-Blanquet similaritynear neighbor search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05)

Related Items (2)

Index structures for fast similarity search for binary vectors ⋮ ForestDSH: a universal hash design for discrete probability distributions

This page was built for publication: Set similarity search beyond MinHash