Fetching the paper…
Reading the bibliography…
Given a collection of objects and an associated similarity measure, the all-pairs similarity search problem asks us to find all pairs of objects with similarity greater than a certain user-specified threshold.
Syntactic clustering of the web
A. Z. Broder, S. C. Glassman, M. S. Manasse, and G. Zweig · 1997
Earlier work this paper cites.
Min-wise independent permutations (extended abstract)
A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher · 1998
Earlier work this paper cites.
Approximate nearest neighbors: towards removing the curse of dimensionality
P. Indyk and R. Motwani · 1998
Earlier work this paper cites.
Similarity search in high dimensions via hashing
A. Gionis, P. Indyk, and R. Motwani · 1999
Earlier work this paper cites.
Similarity estimation techniques from rounding algorithms
M. S. Charikar · 2002
Earlier work this paper cites.
Locality-sensitive hashing scheme based on p-stable distributions
M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni · 2004
Earlier work this paper cites.
Rcv1: A new benchmark collection for text categorization research
D. Lewis, Y. Yang, T. Rose, and F. Li · 2004
Earlier work this paper cites.
Randomized algorithms and nlp: using locality sensitive hash function for high speed noun clustering
D. Ravichandran, P. Pantel, and E. Hovy · 2005
Earlier work this paper cites.
Finding near-duplicate web pages: a large-scale evaluation of algorithms
M. Henzinger · 2006
Earlier work this paper cites.
Scaling up all pairs similarity search
R. Bayardo, Y. Ma, and R. Srikant · 2007
Cited alongside, same era.
The link-prediction problem for social networks
D. Liben-Nowell and J. Kleinberg · 2007
Cited alongside, same era.
Multi-probe lsh: efficient indexing for high-dimensional similarity search
Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li · 2007
Cited alongside, same era.
Detecting near-duplicates for web crawling
G. S. Manku, A. Jain, and A. Das Sarma · 2007
Cited alongside, same era.
Measurement and Analysis of Online Social Networks
A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee · 2007
Cited alongside, same era.
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
A. Andoni and P. Indyk · 2008
Cited alongside, same era.
Quality and efficiency in high dimensional nearest neighbor search
Y. Tao, K. Yi, C. Sheng, and P. Kalnis · 2009
Later among the works it cites.
Introduction to semi-supervised learning
X. Zhu and A. Goldberg · 2009
Later among the works it cites.
What is Twitter, a social network or a news media?
H. Kwak, C. Lee, H. Park, and S. Moon · 2010
Later among the works it cites.
b-bit minwise hashing
P. Li and C. König · 2010
Later among the works it cites.
When close enough is good enough: Approximate positional indexes for efficient ranked retrieval
T. Elsayed, J. Lin, and D. Metzler · 2011
Closest in time.
Symmetrizations for clustering directed graphs
V. Satuluri and S. Parthasarathy · 2011
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Fast image search for learned metrics
P. Jain, B. Kulis, and K. Grauman · 2008
Cited alongside, same era.
Efficient similarity joins for near duplicate detection
C. Xiao, W. Wang, X. Lin, and J. Yu · 2008
Cited alongside, same era.
Building rome in a day
S. Agarwal, N. Snavely, I. Simon, S. Seitz, and R. Szeliski · 2009
Cited alongside, same era.
Local graph sparsification for scalable clustering
V. Satuluri, S. Parthasarathy, and Y. Ruan · 2011
Closest in time.
Efficient similarity joins for near duplicate detection
C. Xiao, W. Wang, X. Lin, J. X. Yu, and G. Wang · 2011
Closest in time.
Atlas: a probabilistic algorithm for high dimensional similarity search
J. Zhai, Y. Lou, and J. Gehrke · 2011
Closest in time.