Fetching the paper…
Reading the bibliography…
We consider the problem of approximate set similarity search under Braun-Blanquet similarity $B(\mathbf{x}, \mathbf{y}) = |\mathbf{x} \cap \mathbf{y}| / \max(|\mathbf{x}|, |\mathbf{y}|)$.
Plant sociology. The study of plant communities
Josias Braun-Blanquet. 1932 · 1932
Earlier work this paper cites.
Probability inequalities for sums of bounded random variables
W. Hoeffding. 1963 · 1963
Earlier work this paper cites.
A new hashing method with application for game playing
Albert L Zobrist. 1970 · 1970
Earlier work this paper cites.
On the resemblance and containment of documents. In Compression and Complexity of Sequences 1997. Proceedings
Andrei Z. Broder. 1997 · 1997
Earlier work this paper cites.
Syntactic clustering of the web
Andrei Z. Broder, Steven C. Glassman, Mark S. Manasse, and Geoffrey Zweig. 1997 · 1997
Earlier work this paper cites.
Size-estimation framework with applications to transitive closure and reachability
E. Cohen. 1997 · 1997
Earlier work this paper cites.
Sorting and Searching on the Word RAM. In Proc. STACS ’98
T. Hagerup. 1998 · 1998
Earlier work this paper cites.
Approximate nearest neighbors: towards removing the curse of dimensionality. In Proc. STOC ’98
P. Indyk and R. Motwani. 1998 · 1998
Earlier work this paper cites.
Similarity estimation techniques from rounding algorithms. In Proc. STOC ’02
M. Charikar. 2002 · 2002
Earlier work this paper cites.
Probability and computing
M. Mitzenmacher and E. Upfal. 2005 · 2005
Earlier work this paper cites.
Efficient exact set-similarity joins. In Proceedings of the 32nd international conference on Very large data bases
Arvind Arasu, Venkatesh Ganti, and Raghav Kaushik. 2006 · 2006
Earlier work this paper cites.
Scaling up all pairs similarity search. In Proceedings of the 16th international conference on World Wide Web
Roberto J Bayardo, Yiming Ma, and Ramakrishnan Srikant. 2007 · 2007
Earlier work this paper cites.
Lower Bounds on Locality Sensitive Hashing
R. Motwani, A. Naor, and R. Panigrahy. 2007 · 2007
Earlier work this paper cites.
Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere. In Proc. WADS ’07
K. Terasawa and Y. Tanaka. 2007 · 2007
Cited alongside, same era.
Some Bounds for the Logarithmic Function
F. Topsœ. 2007 · 2007
Cited alongside, same era.
Leveraging discarded samples for tighter estimation of multiple-set aggregates
E. Cohen and H. Kaplan. 2009 · 2009
Cited alongside, same era.
A survey of binary similarity and distance measures
S. Choi, S. Cha, and C. C. Tappert. 2010 · 2010
Cited alongside, same era.
Bucketing coding and information theory for the statistical high-dimensional nearest-neighbor problem
M. Dubiner. 2010 · 2010
Cited alongside, same era.
Randomized algorithms
Rajeev Motwani and Prabhakar Raghavan. 2010 · 2010
Cited alongside, same era.
Optimal lower bounds for locality-sensitive hashing (except when q is tiny)
R. O’Donnell, Y. Wu, and Y. Zhou. 2014 · 2014
Later among the works it cites.
Is min-wise hashing optimal for summarizing set intersection?. In Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rasmus Pagh, Morten Stöckel, and David P Woodruff. 2014 · 2014
Later among the works it cites.
Practical and optimal LSH for angular distance. In Proc. NIPS ’15
A. Andoni, P. Indyk, T. Laarhoven, I. Razenshteyn, and L. Schmidt. 2015 · 2015
Later among the works it cites.
Optimal Data-Dependent Hashing for Approximate Near Neighbors. In Proc. STOC ’15
A. Andoni and I. Razenshteyn. 2015 · 2015
Later among the works it cites.
LSH-Preserving Functions and Their Applications
F. Chierichetti and R. Kumar. 2015 · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Lower Bounds on Near Neighbor Search via Metric Expansion. In Proc. FOCS ’10
R. Panigrahy, K. Talwar, and U. Wieder. 2010 · 2010
Cited alongside, same era.
Theory and applications of b-bit minwise hashing
Ping Li and Arnd Christian König. 2011 · 2011
Cited alongside, same era.
Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality
S. Har-Peled, P. Indyk, and R. Motwani. 2012 · 2012
Cited alongside, same era.
Bottom-k and priority sampling, set similarity and subset sums with minimal independence. In Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Mikkel Thorup. 2013 · 2013
Cited alongside, same era.
Beyond Locality-Sensitive Hashing. In Proc. SODA ’14
A. Andoni, P. Indyk, H. L. Nguyen, and I. P. Razenshteyn. 2014 · 2014
Cited alongside, same era.
Efficient estimation for high similarities using odd sketches. In Proc. WWW ’14
M. Mitzenmacher, R. Pagh, and N. Pham. 2014 · 2014
Cited alongside, same era.
T. Laarhoven. 2015 · 2015
Later among the works it cites.
Asymmetric minwise hashing for indexing binary inner products and set containment. In Proceedings of the 24th International Conference on World Wide Web
Anshumali Shrivastava and Ping Li. 2015 · 2015
Later among the works it cites.
On the Complexity of Inner Product Similarity Join. In Proc. PODS’16
T. D. Ahle, R. Pagh, I. P. Razenshteyn, and F. Silvestri. 2016 · 2016
Closest in time.
Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing. In Proc. SoCG ’16
A. Andoni and I. Razensteyn. 2016 · 2016
Closest in time.
New directions in nearest neighbor searching with applications to lattice sieving. In Proc. SODA ’16
A. Becker, L. Ducas, N. Gama, and T. Laarhoven. 2016 · 2016
Closest in time.
Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors. In Proc. SODA ’17
A. Andoni, T. Laarhoven, I. P. Razenshteyn, and E. Waingarten. 2017 · 2017
Closest in time.
A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering. In Proc. SODA ’17
T. Christiani. 2017 · 2017
Closest in time.