Fetching the paper…
Reading the bibliography…
We propose a new class of data-independent locality-sensitive hashing (LSH) algorithms based on the fruit fly olfactory circuit.
A. Broder, “On the resemblance and containment of documents,” in Proc. of the Compression and Complexity of Sequences , ser. SEQUENCES ’97. IEEE Computer Society, 1997, pp. 21–
1997
Earlier work this paper cites.
P. Indyk and R. Motwani, “Approximate nearest neighbors: Towards removing the curse of dimensionality,” in Proc. of the Annual ACM Symposium on Theory of Computing , ser. STOC ’98, 1998, pp. 604–613
1998
Earlier work this paper cites.
Y. Lecun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,” Proc. of the IEEE , vol. 86, no. 11, pp. 2278–2324, Nov 1998
1998
Earlier work this paper cites.
A. Gionis, P. Indyk, and R. Motwani, “Similarity search in high dimensions via hashing,” in Proc. of the Intl. Conf. on Very Large Data Bases , ser. VLDB ’99, 1999, pp. 518–529
1999
Earlier work this paper cites.
M. S. Charikar, “Similarity estimation techniques from rounding algorithms,” in Proc. of the Annual ACM Symposium on Theory of Computing , ser. STOC ’02, 2002, pp. 380–388
2002
Earlier work this paper cites.
D. Achlioptas, “Database-friendly random projections: Johnson-lindenstrauss with binary coins,” J. Comput. Syst. Sci. , vol. 66, no. 4, pp. 671–687, Jun. 2003. [Online]. Available: http://dx.doi.org/10.1016/S0022-0000(03)00025-4
2003
Earlier work this paper cites.
T. Liu, A. W. Moore, A. Gray, and K. Yang, “An investigation of practical approximate nearest neighbor algorithms,” in Proc. of the 17th Intl. Conf. on Neural Information Processing Systems , ser. NIPS ’04, 2004, pp. 825–832
2004
Earlier work this paper cites.
M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, “Locality-sensitive hashing scheme based on p-stable distributions,” in Proc. of the 20th Annual ACM Symposium on Computational Geometry , ser. SCG ’04, 2004, pp. 253–262
2004
Earlier work this paper cites.
H. Samet, Foundations of Multidimensional and Metric Data Structures . San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 2005
2005
Earlier work this paper cites.
E. A. Hallem and J. R. Carlson, “Coding of odors by a receptor repertoire,” Cell , vol. 125, no. 1, pp. 143–160, Apr 2006
2006
Earlier work this paper cites.
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 , ser. KDD ’06. New York, NY, USA: ACM, 2006, pp. 287–296. [Online]. Available: http://doi.acm.org/10.1145/1150402.1150436
2006
Earlier work this paper cites.
B. Wang, Z. Li, M. Li, and W. y. Ma, “Large-scale duplicate detection for web image search,” in IEEE Intl. Conf. on Multimedia and Expo , July 2006, pp. 353–356
2006
Earlier work this paper cites.
X.-J. Wang, L. Zhang, F. Jing, and W.-Y. Ma, “Annosearch: Image auto-annotation by search,” in IEEE Computer Society Conf. on Computer Vision and Pattern Recognition , ser. CVPR ’06, vol. 2, 2006, pp. 1483–1490
2006
Earlier work this paper cites.
Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li, “Multi-probe lsh: Efficient indexing for high-dimensional similarity search,” in Proc. of the Intl. Conf. on Very Large Data Bases , ser. VLDB ’07, 2007, pp. 950–961
2007
Earlier work this paper cites.
A. Andoni and P. Indyk, “Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions,” Commun. ACM , vol. 51, no. 1, pp. 117–122, Jan. 2008
2008
Cited alongside, same era.
C. M. Root, K. Masuyama, D. S. Green, L. E. Enell, D. R. Nassel, C. H. Lee, and J. W. Wang, “A presynaptic gain control mechanism fine-tunes olfactory behavior,” Neuron , vol. 59, no. 2, pp. 311–321, Jul 2008
2008
Cited alongside, same era.
K. Eshghi and S. Rajaram, “Locality sensitive hash functions based on concomitant rank order statistics,” in Proc. of the 14th ACM Intl. Conf. on Knowledge Discovery and Data Mining , ser. KDD ’08, 2008, pp. 221–229
2008
Cited alongside, same era.
Y. Weiss, A. Torralba, and R. Fergus, “Spectral hashing,” in Proc. of the Intl. Conf. on Neural Information Processing , ser. NIPS ’09, 2008, pp. 1753–1760
2008
Cited alongside, same era.
D. Chen, X. Cao, F. Wen, and J. Sun, “Blessing of dimensionality: High-dimensional feature and its efficient compression for face verification,” in Proc. of the IEEE Conference on Computer Vision and Pattern Recognition , ser. CVPR ’13, June 2013, pp. 3025–3032
2013
Later among the works it cites.
2014
Later among the works it cites.
D. Kane and J. Nelson, “Sparser Johnson-Lindenstrauss transforms,” Journal of the Association for Computing Machinery , vol. 61, no. 1, 2014
2014
Later among the works it cites.
Z. Allen-Zhu, R. Gelashvili, S. Micali, and N. Shavit, “Sparse sign-consistent Johnson-Lindenstrauss matrices: compression with neuroscience-based constraints,” Proc. Natl. Acad. Sci. U.S.A. , vol. 111, no. 47, pp. 16 872–16 876, Nov 2014
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
B. C. Russell, A. Torralba, K. P. Murphy, and W. T. Freeman, “Labelme: A database and web-based tool for image annotation,” Int. J. Comput. Vision , vol. 77, no. 1-3, pp. 157–173, May 2008
2008
Cited alongside, same era.
K. Asahina, M. Louis, S. Piccinotti, and L. B. Vosshall, “A circuit supporting concentration-invariant odor perception in Drosophila,” J. Biol. , vol. 8, no. 1, p. 9, 2009
2009
Cited alongside, same era.
Q. Shi, J. Petterson, G. Dror, J. Langford, A. Smola, and S. Vishwanathan, “Hash kernels for structured data,” J. Mach. Learn. Res. , vol. 10, pp. 2615–2637, Dec. 2009
2009
Cited alongside, same era.
S. R. Olsen, V. Bhandawat, and R. I. Wilson, “Divisive normalization in olfactory population codes,” Neuron , vol. 66, no. 2, pp. 287–299, Apr 2010
2010
Cited alongside, same era.
A. Dasgupta, R. Kumar, and T. Sarlos, “Fast locality-sensitive hashing,” in Proc. of the 17th ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining , ser. KDD ’11. New York, NY, USA: ACM, 2011, pp. 1073–1081
2011
Cited alongside, same era.
J. Yagnik, D. Strelow, D. A. Ross, and R. Lin, “The power of comparative reasoning,” in Proc. of the Intl. Conf. on Computer Vision , ser. ICCV ’11. Washington, DC, USA: IEEE Computer Society, 2011, pp. 2431–2438
2011
Cited alongside, same era.
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, Jan. 2011
2011
Cited alongside, same era.
Y. Delalleau, O. Bengio, “Shallow vs. deep sum-product networks,” in Proc. of the 24th Intl. Conf. on Neural Information Processing Systems , ser. NIPS ’11, 2011, pp. 666–674
2011
Cited alongside, same era.
A. Shrivastava and P. Li, “In defense of Minhash over Simhash,” in Proc. of the Intl. Conf. on Artificial Intelligence and Statistics , ser. AISTATS ’14, 2014, pp. 886–894
2014
Later among the works it cites.
J. Pennington, R. Socher, and C. D. Manning, “Glove: Global vectors for word representation,” in Empirical Methods in Natural Language Processing (EMNLP) , 2014, pp. 1532–1543
2014
Later among the works it cites.
Z. Jin, C. Li, Y. Lin, and D. Cai, “Density sensitive hashing,” IEEE transactions on cybernetics , vol. 44, no. 8, pp. 1362–1371, 2014
2014
Later among the works it cites.
C. F. Stevens, “What the fly’s nose tells the fly’s brain,” Proc. Natl. Acad. Sci. U.S.A. , vol. 112, no. 30, pp. 9460–9465, Jul 2015
2015
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 Proc. of the 28th Intl. Conf. on Neural Information Processing Systems , ser. NIPS’15. Cambridge, MA, USA: MIT Press, 2015, pp. 1225–1233
2015
Later among the works it cites.
T. Hige, Y. Aso, M. N. Modi, G. M. Rubin, and G. C. Turner, “Heterosynaptic plasticity underlies aversive olfactory learning in Drosophila,” Neuron , vol. 88, no. 5, pp. 985–998, Dec 2015
2015
Later among the works it cites.
C. F. Stevens, “A statistical property of fly odor responses is conserved across odors,” Proc. Natl. Acad. Sci. U.S.A. , vol. 113, no. 24, pp. 6737–6742, Jun 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
S. Dasgupta, C. F. Stevens, and S. Navlakha, “A neural algorithm for a fundamental computing problem,” Science , vol. 358, no. 6364, pp. 793–796, 11 2017
2017
Later among the works it cites.