Fetching the paper…
Reading the bibliography…
Efficient index structures for fast approximate nearest neighbor queries are required in many applications such as recommendation systems.
J. L. Bentley, “Multidimensional binary search trees used for associative searching,” Communications of the ACM , vol. 18, no. 9, pp. 509–517, 1975
1975
Earlier work this paper cites.
K. Fukunaga and P. M. Narendra, “A branch and bound algorithm for computing k-nearest neighbors,” IEEE transactions on computers , vol. 100, no. 7, pp. 750–753, 1975
1975
Earlier work this paper cites.
P. N. Yianilos, “Data structures and algorithms for nearest neighbor search in general metric spaces,” in SODA , vol. 93, no. 194, 1993, pp. 311–21
1993
Earlier work this paper cites.
Y. Amit and D. Geman, “Shape quantization and recognition with randomized trees,” Neural computation , vol. 9, no. 7, pp. 1545–1588, 1997
1997
Earlier work this paper cites.
P. Indyk and R. Motwani, “Approximate nearest neighbors: towards removing the curse of dimensionality,” in Proceedings of the thirtieth annual ACM symposium on Theory of computing . ACM, 1998, pp. 604–613
1998
Earlier work this paper cites.
S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu, “An optimal algorithm for approximate nearest neighbor searching fixed dimensions,” Journal of the ACM (JACM) , vol. 45, no. 6, pp. 891–923, 1998
1998
Earlier work this paper cites.
A. Gionis, P. Indyk, R. Motwani et al. , “Similarity search in high dimensions via hashing,” in VLDB , vol. 99, no. 6, 1999, pp. 518–529
1999
Earlier work this paper cites.
D. Achlioptas, “Database-friendly random projections,” in Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems . ACM, 2001, pp. 274–281
2001
Earlier work this paper cites.
D. G. Lowe, “Distinctive image features from scale-invariant keypoints,” International journal of computer vision , vol. 60, no. 2, pp. 91–110, 2004
2004
Earlier work this paper cites.
D. Nister and H. Stewenius, “Scalable recognition with a vocabulary tree,” in 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’06) , vol. 2. IEEE, 2006, pp. 2161–2168
2006
Earlier work this paper cites.
A. Andoni and P. Indyk, “Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions,” in Foundations of Computer Science, 2006. FOCS’06. 47th Annual IEEE Symposium on . IEEE, 2006, pp. 459–468
2006
Earlier work this paper cites.
A. Beygelzimer, S. Kakade, and J. Langford, “Cover trees for nearest neighbor,” in Proceedings of the 23rd international conference on Machine learning . ACM, 2006, pp. 97–104
2006
Cited alongside, same era.
B. Leibe, K. Mikolajczyk, and B. Schiele, “Efficient clustering and matching for object class recognition.” in BMVC , 2006, pp. 789–798
2006
Cited alongside, same era.
P. Li, T. J. Hastie, and K. W. Church, “Very sparse random projections,” in Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining . ACM, 2006, pp. 287–296
2006
Cited alongside, same era.
J. Hays and A. A. Efros, “Scene completion using millions of photographs,” in ACM Transactions on Graphics (TOG) , vol. 26, no. 3. ACM, 2007, p. 4
2007
Cited alongside, same era.
K. Hajebi, Y. Abbasi-Yadkori, H. Shahbazi, and H. Zhang, “Fast approximate nearest-neighbor search with k-nearest neighbor graph,” in IJCAI Proceedings-International Joint Conference on Artificial Intelligence , vol. 22, no. 1, 2011, p. 1312
2011
Later among the works it cites.
W. Dong, C. Moses, and K. Li, “Efficient k-nearest neighbor graph construction for generic similarity measures,” in Proceedings of the 20th international conference on World wide web . ACM, 2011, pp. 577–586
2011
Later among the works it cites.
H. Jégou, M. Douze, and C. Schmid, “Product quantization for nearest neighbor search,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 33, no. 1, pp. 117–128, 2011
2011
Later among the works it cites.
H. Jegou, R. Tavenard, M. Douze, and L. Amsaleg, “Searching in one billion vectors: Re-rank with source coding,” in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011 , 2011, pp. 861–864
2011
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2007
Cited alongside, same era.
S. A. J. Winder and M. A. Brown, “Learning local image descriptors,” in 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2007) , 2007
2007
Cited alongside, same era.
W. Dong, Z. Wang, W. Josephson, M. Charikar, and K. Li, “Modeling lsh for performance tuning,” in Proceedings of the 17th ACM conference on Information and knowledge management . ACM, 2008, pp. 669–678
2008
Cited alongside, same era.
C. Silpa-Anan and R. Hartley, “Optimised kd-trees for fast image descriptor matching,” in Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on . IEEE, 2008, pp. 1–8
2008
Cited alongside, same era.
M. Muja and D. G. Lowe, “Fast approximate nearest neighbors with automatic algorithm configuration.” VISAPP (1) , vol. 2, pp. 331–340, 2009
2009
Cited alongside, same era.
S. Dasgupta and Y. Freund, “Random projection trees for vector quantization,” IEEE Transactions on Information Theory , vol. 55, no. 7, pp. 3229–3242, 2009
2009
Cited alongside, same era.
Later among the works it cites.
A. Coates, A. Y. Ng, and H. Lee, “An analysis of single-layer networks in unsupervised feature learning,” in Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, AISTATS 2011 , 2011, pp. 215–223
2011
Later among the works it cites.
J. Wang, J. Wang, G. Zeng, Z. Tu, R. Gan, and S. Li, “Scalable k-nn graph construction for visual descriptors,” in Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on . IEEE, 2012, pp. 1106–1113
2012
Later among the works it cites.
M. Muja and D. G. Lowe, “Scalable nearest neighbor algorithms for high dimensional data,” Pattern Analysis and Machine Intelligence, IEEE Transactions on , vol. 36, no. 11, pp. 2227–2240, 2014
2014
Later among the works it cites.
A. Andoni, P. Indyk, T. Laarhoven, I. Razenshteyn, and L. Schmidt, “Practical and optimal lsh for angular distance,” in Advances in Neural Information Processing Systems 28 . Curran Associates, Inc., 2015, pp. 1225–1233
2015
Closest in time.
S. Dasgupta and K. Sinha, “Randomized partition trees for nearest neighbor search,” Algorithmica , vol. 72, no. 1, pp. 237–263, 2015
2015
Closest in time.
L. Wang, S. Tasoulis, T. Roos, and J. Kangasharju, “Kvasir: Scalable provision of semantically relevant web content on big data framework,” IEEE Transactions on Big Data , vol. Advance online publication. DOI:10.1109/TBDATA.2016.2557348, 2016
2016
Closest in time.