Fetching the paper…
Reading the bibliography…
The explosive growth in big data has attracted much attention in designing efficient indexing and search methods recently.
R. Bellman, Dynamic programming , ser. Rand Corporation research study. Princeton University Press, 1957
1957
Earlier work this paper cites.
J. Bentley, “Multidimensional binary search trees used for associative searching,” Communications of the ACM , vol. 18, no. 9, p. 517, 1975
1975
Earlier work this paper cites.
S. Omohundro, “Efficient algorithms with neural network behavior,” Complex Systems , vol. 1, no. 2, pp. 273–347, 1987
1987
Earlier work this paper cites.
J. Uhlmann, “Satisfying general proximity/similarity queries with metric trees,” Information Processing Letters , vol. 40, no. 4, pp. 175–179, 1991
1991
Earlier work this paper cites.
P. Yianilos, “Data structures and algorithms for nearest neighbor search in general metric spaces,” in Proc. of the fourth annual ACM-SIAM Symposium on Discrete algorithms , 1993, pp. 311–321
1993
Earlier work this paper cites.
Y. Freund and R. Schapire, “A desicion-theoretic generalization of on-line learning and an application to boosting,” in Computational Learning Theory , 1995, pp. 23–37
1995
Earlier work this paper cites.
D. Knuth, Art of Computer Programming, Volume 3: Sorting and searching . Addison-Wesley Professional, 1997
1997
Earlier work this paper cites.
A. Broder, “On the resemblance and containment of documents,” in Compression and Complexity of Sequences Proceedings , 1997, pp. 21–29
1997
Earlier work this paper cites.
A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher, “Min-wise independent permutations,” in Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing , 1998, pp. 327–336
1998
Earlier work this paper cites.
P. Indyk and R. Motwani, “Approximate nearest neighbors: towards removing the curse of dimensionality,” in Proc. of 30th ACM Symposium on Theory of Computing , 1998, pp. 604–613
1998
Earlier work this paper cites.
A. Gionis, P. Indyk, and R. Motwani, “Similarity search in high dimensions via hashing,” in Proc. of 25th International Conference on Very Large Data Bases , 1999, pp. 518–529
1999
Earlier work this paper cites.
A. Smeulders, M. Worring, S. Santini, A. Gupta, and R. Jain, “Content-based image retrieval at the end of the early years,” IEEE Trans. on Pattern Analysis and Machine Intelligence , vol. 22, no. 12, pp. 1349–1380, 2000
2000
Earlier work this paper cites.
S. Tong and D. Koller, “Support vector machine active learning with applications to text classification,” Journal of Machine Learning Research , vol. 2, pp. 45–66, 2001
2001
Earlier work this paper cites.
M. S. Charikar, “Similarity estimation techniques from rounding algorithms,” in Proceedings of the thiry-fourth annual ACM symposium on Theory of computing . ACM, 2002, pp. 380–388
2002
Earlier work this paper cites.
G. Shakhnarovich, P. Viola, and T. Darrell, “Fast pose estimation with parameter-sensitive hashing,” in IEEE International Conference on Computer Vision , Nice, France, 2003, pp. 750–757
2003
Earlier work this paper cites.
P. Indyk, “Nearest-neighbor searching in high dimensions,” in Handbook of discrete and computational geometry , J. E. Goodman and J. O’Rourke, Eds. Boca Raton, FL: CRC Press LLC, 2004
2004
Earlier work this paper cites.
M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni, “Locality-sensitive hashing scheme based on p-stable distributions,” in Proceedings of the twentieth annual Symposium on Computational Geometry , 2004, pp. 253–262
2004
Earlier work this paper cites.
C. Fowlkes, S. Belongie, F. Chung, and J. Malik, “Spectral grouping using the Nyström method,” IEEE Transactions on Pattern Analysis and Machine Intelligence , no. 2, pp. 214–225, 2004
2004
Earlier work this paper cites.
G. Shakhnarovich, “Learning task-specific similarity,” Ph.D. dissertation, Massachusetts Institute of Technology, 2005
2005
Earlier work this paper cites.
M. Bawa, T. Condie, and P. Ganesan, “LSH forest: self-tuning indexes for similarity search,” in Proceedings of the 14th international conference on World Wide Web , Chiba, Japan, 2005, pp. 651–660
2005
Earlier work this paper cites.
G. Shakhnarovich, T. Darrell, and P. Indyk, Nearest-neighbor methods in learning and vision: theory and practice . MIT Press, 2006
2006
Earlier work this paper cites.
M. Henzinger, “Finding near-duplicate web pages: a large-scale evaluation of algorithms,” in Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval , 2006, pp. 284–291
2006
Earlier work this paper cites.
R. M. Gray, Toeplitz and circulant matrices: A review . now publishers inc, 2006
2006
Earlier work this paper cites.
G. Hinton and R. Salakhutdinov, “Reducing the dimensionality of data with neural networks,” Science , vol. 313, no. 5786, pp. 504–507, 2006
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 Proceedings of the 33rd international conference on Very large data bases , 2007, pp. 950–961
2007
Earlier work this paper cites.
A. S. Das, M. Datar, A. Garg, and S. Rajaram, “Google news personalization: scalable online collaborative filtering,” in Proceedings of the 16th international conference on World Wide Web , 2007, pp. 271–280
2007
Earlier work this paper cites.
J. V. Davis, B. Kulis, P. Jain, S. Sra, and I. S. Dhillon, “Information-theoretic metric learning,” in Proceedings of the 24th international conference on Machine learning , 2007, pp. 209–216
2007
Earlier work this paper cites.
R. Salakhutdinov and G. Hinton, “Learning a nonlinear embedding by preserving class neighbourhood structure,” in Proc. International Conference on Artificial Intelligence and Statistics , 2007, pp. 412–419
2007
Earlier work this paper cites.
G. S. Manku, A. Jain, and A. Das Sarma, “Detecting near-duplicates for web crawling,” in Proceedings of the 16th international conference on World Wide Web , 2007, pp. 141–150
2007
Earlier work this paper cites.
R. Datta, D. Joshi, J. Li, and J. Z. Wang, “Image retrieval: Ideas, influences, and trends of the new age,” ACM Computing Surveys , vol. 40, no. 2, pp. 1–60, 2008
2008
Earlier work this paper cites.
A. Torralba, R. Fergus, and W. Freeman, “80 million tiny images: A large data set for nonparametric object and scene recognition,” IEEE Trans. on Pattern Analysis and Machine Intelligence , vol. 30, no. 11, pp. 1958–1970, 2008
2008
Earlier work this paper cites.
L. Cayton and S. Dasgupta, “A learning framework for nearest neighbor search,” in Advances in Neural Information Processing Systems 20 , J. Platt, D. Koller, Y. Singer, and S. Roweis, Eds. Cambridge, MA: MIT Press, 2008, pp. 233–240
2008
Earlier work this paper cites.
Y. Weiss, A. Torralba, and R. Fergus, “Spectral hashing,” in Proc. of Advances in Neural Information Processing Systems , D. Koller, D. Schuurmans, Y. Bengio, and L. Bottou, Eds. MIT Press, 2008, vol. 21, pp. 1753–1760
2008
Earlier work this paper cites.
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 , 2008, pp. 669–678
2008
Earlier work this paper cites.
O. Chum, J. Philbin, and A. Zisserman, “Near duplicate image detection: min-hash and tf-idf weighting.” in Proceedings of the the British Machine Vision Conference , vol. 810, 2008, pp. 812–815
2008
Earlier work this paper cites.
A. Torralba, R. Fergus, and Y. Weiss, “Small codes and large image databases for recognition,” in IEEE Conference on Computer Vision and Pattern Recognition , Anchorage, Alaska, USA, 2008, pp. 1–8
2008
Earlier work this paper cites.
P. Jain, B. Kulis, and K. Grauman, “Fast image search for learned metrics,” in IEEE Conference on Computer Vision and Pattern Recognition , Anchorage, Alaska, USA, 2008, pp. 1–8
2008
Earlier work this paper cites.
P. Jain, B. Kulis, I. S. Dhillon, and K. Grauman, “Online metric learning and fast similarity search,” in Advances in neural information processing systems , 2008, pp. 761–768
2008
Earlier work this paper cites.
V. Athitsos, J. Alon, S. Sclaroff, and G. Kollios, “Boostmap: An embedding method for efficient nearest neighbor retrieval,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 30, no. 1, pp. 89–104, Jan. 2008
2008
Earlier work this paper cites.
B. Kulis, P. Jain, and K. Grauman, “Fast similarity search for learned metrics,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 31, no. 12, pp. 2143–2157, 2009
2009
Earlier work this paper cites.
B. Kulis and T. Darrell, “Learning to Hash with Binary Reconstructive Embeddings,” in Proc. of Advances in Neural Information Processing Systems , Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, and A. Culotta, Eds., 2009, vol. 20, pp. 1042–1050
2009
Earlier work this paper cites.
M. Raginsky and S. Lazebnik, “Locality-sensitive binary codes from shift-invariant kernels,” in Advances in Neural Information Processing Systems 22 , Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, and A. Culotta, Eds. MIT Press, 2009, pp. 1509–1517
2009
Earlier work this paper cites.
B. Kulis and K. Grauman, “Kernelized locality-sensitive hashing for scalable image search,” in IEEE International Conference on Computer Vision , kyoto, Japan, 2009, pp. 2130 – 2137
2009
Earlier work this paper cites.
O. Chum, M. Perdoch, and J. Matas, “Geometric min-hashing: Finding a (thick) needle in a haystack,” in IEEE Computer Society Conference on Computer Vision and Pattern Recognition , Miami, Florida, USA, 2009, pp. 17–24
2009
Earlier work this paper cites.
R. Salakhutdinov and G. Hinton, “Semantic hashing,” International Journal of Approximate Reasoning , vol. 50, no. 7, pp. 969–978, 2009
2009
Earlier work this paper cites.
Q. Shi, J. Petterson, G. Dror, J. Langford, A. Smola, and S. Vishwanathan, “Hash kernels for structured data,” The Journal of Machine Learning Research , vol. 10, pp. 2615–2637, 2009
2009
Earlier work this paper cites.
J. Wang, S. Kumar, and S.-F. Chang, “Sequential projection learning for hashing with compact codes,” in Proceedings of the 27th International Conference on Machine Learning , 2010, pp. 1127–1134
2010
Earlier work this paper cites.
J. Wang, S. Kumar, and S.-F. Chang, “Semi-supervised hashing for scalable image retrieval,” in IEEE Computer Society Conference on Computer Vision and Pattern Recognition , San Francisco, USA, 2010, pp. 3424–3431
2010
Earlier work this paper cites.
Y. Mu, J. Shen, and S. Yan, “Weakly-supervised hashing in kernel space,” in IEEE Computer Society Conference on Computer Vision and Pattern Recognition , San Francisco, USA, 2010, pp. 3344–3351
2010
Earlier work this paper cites.
Y. Mu and S. Yan, “Non-metric locality-sensitive hashing.” in Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence , 2010, pp. 539–544
2010
Earlier work this paper cites.
S. Ioffe, “Improved consistent sampling, weighted minhash and l1 sketching,” in IEEE International Conference on Data Mining . IEEE, 2010, pp. 246–255
2010
Cited alongside, same era.
P. Li and C. König, “b-bit minwise hashing,” in Proceedings of the 19th International Conference on World Wide Web , 2010, pp. 671–680
2010
Cited alongside, same era.
P. Li, A. Konig, and W. Gui, “b-bit minwise hashing for estimating three-way similarities,” in Advances in Neural Information Processing Systems 23 , J. Lafferty, C. K. I. Williams, J. Shawe-Taylor, R. Zemel, and A. Culotta, Eds., 2010, pp. 1387–1395
2010
Cited alongside, same era.
H. Jégou, M. Douze, C. Schmid, and P. Pérez, “Aggregating local descriptors into a compact image representation,” in IEEE Conference on Computer Vision and Pattern Recognition , 2010, pp. 3304–3311
2010
Cited alongside, same era.
Y. Zhen and D.-Y. Yeung, “A probabilistic model for multimodal hash function learning,” in Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2012, pp. 940–948
2012
Later among the works it cites.
L. Cao, Z. Li, Y. Mu, and S.-F. Chang, “Submodular video hashing: a unified framework towards video pooling and indexing,” in Proceedings of the 20th ACM international conference on Multimedia , 2012, pp. 299–308
2012
Later among the works it cites.
W. Kong, W.-J. Li, and M. Guo, “Manhattan hashing for large-scale image retrieval,” in Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval , 2012, pp. 45–54
2012
Later among the works it cites.
J. He, J. Feng, X. Liu, T. Cheng, T.-H. Lin, H. Chung, and S.-F. Chang, “Mobile product search with bag of hash bits and boundary reranking,” in IEEE Conference on Computer Vision and Pattern Recognition , Providence, RI, USA, 2012, pp. 3005–3012
2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. He, W. Liu, and S.-F. Chang, “Scalable similarity search with optimized kernel hashing,” in Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2010, pp. 1129–1138
2010
Cited alongside, same era.
R.-S. Lin, D. A. Ross, and J. Yagnik, “Spec hashing: Similarity preserving algorithm for entropy-based coding,” in IEEE Computer Society Conference on Computer Vision and Pattern Recognition , San Francisco, USA, 2010, pp. 848–854
2010
Cited alongside, same era.
D. Zhang, J. Wang, D. Cai, and J. Lu, “Self-taught hashing for fast similarity search,” in Proceedings of the 33rd International ACM SIGIR Conference on Research and Development in Information Retrieval , 2010, pp. 18–25
2010
Cited alongside, same era.
W. Liu, J. He, and S.-F. Chang, “Large graph construction for scalable semi-supervised learning,” in Proceedings of the 27th International Conference on Machine Learning , 2010, pp. 679–686
2010
Cited alongside, same era.
K. Gregor and Y. LeCun, “Learning fast approximations of sparse coding,” in Proc. International Conference on Machine Learning , 2010, pp. 399–406
2010
Cited alongside, same era.
P. Jain, S. Vijayanarasimhan, and K. Grauman, “Hashing hyperplane queries to near points with applications to large-scale active learning,” in Advances in Neural Information Processing Systems 23 , J. Lafferty, C. K. I. Williams, J. Shawe-Taylor, R. Zemel, and A. Culotta, Eds. MIT Press, 2010, pp. 928–936
2010
Cited alongside, same era.
K. Grauman, “Efficiently searching for similar images,” Commun. ACM , vol. 53, no. 6, 2010
2010
Cited alongside, same era.
Q. Shi, H. Li, and C. Shen, “Rapid face recognition using hashing,” in IEEE Computer Society Conference on Computer Vision and Pattern Recognition , San Francisco, USA, 2010, pp. 2753–2760
2010
Cited alongside, same era.
Later among the works it cites.
J. Yuan, G. Gravier, S. Campion, X. Liu, and H. J¨¦gou, “Efficient mining of repetitions in large-scale tv streams with product quantization hashing,” in European Conference on Computer Vision , Florence, Italy, 2012, pp. 271–280
2012
Later among the works it cites.
Y. Mu, J. Wright, and S.-F. Chang, “Accelerated large scale optimization by concomitant hashing,” in European Conference on Computer Vision , Florence, Italy, 2012, pp. 414–427
2012
Later among the works it cites.
K. Zhou and H. Zha, “Learning binary codes for collaborative filtering,” in Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2012, pp. 498–506
2012
Later among the works it cites.
T. Ge, K. He, Q. Ke, and J. Sun, “Optimized product quantization for approximate nearest neighbor search,” in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition , Portland, Oregon, USA, 2013, pp. 2946–2953
2013
Later among the works it cites.
Y. Lin, R. Jin, D. Cai, S. Yan, and X. Li, “Compressed hashing,” in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition , Portland, Oregon, USA, 2013, pp. 446–451
2013
Later among the works it cites.
K. He, F. Wen, and J. Sun, “K-means hashing: An affinity-preserving quantization method for learning binary compact codes,” in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition , Portland, Oregon, USA, 2013, pp. 2938–2945
2013
Later among the works it cites.
F. Shen, C. Shen, Q. Shi, A. van den Hengel, and Z. Tang, “Inductive hashing on manifolds,” in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition , Portland, Oregon, USA, 2013, pp. 1562–1569
2013
Later among the works it cites.
L. Fan, “Supervise binary hash code learning with jensen shannon divergence,” in Proceedings of the IEEE International Conference on Computer Vision , 2013
2013
Later among the works it cites.
X. Li, G. Lin, C. Shen, A. V. den Hengel, and A. Dick, “Learning hash functions using column generation,” in Proceedings of the 30th International Conference on Machine Learning , 2013, pp. 142–150
2013
Later among the works it cites.
J. Wang, J. Wang, N. Yu, and S. Li, “Order preserving hashing for approximate nearest neighbor search,” in Proceedings of the 21st ACM international conference on Multimedia , 2013, pp. 133–142
2013
Later among the works it cites.
J. Wang, W. Liu, A. X. Sun, and Y.-G. Jiang, “Learning hash codes with listwise supervision,” in Proceedings of the IEEE International Conference on Computer Vision , 2013
2013
Later among the works it cites.
Z. Jin, Y. Hu, Y. Lin, D. Zhang, S. Lin, D. Cai, and X. Li, “Complementary projection hashing,” in Proceedings of the IEEE International Conference on Computer Vision , 2013
2013
Later among the works it cites.
G. Lin, C. Shen, A. V. den Hengel, and D. Suter, “A general two-step approach to learning-based hashing,” in Proceedings of the IEEE International Conference on Computer Vision , 2013
2013
Later among the works it cites.
Y.-G. Jiang, J. Wang, X. Xue, and S.-F. Chang, “Query-adaptive image search with hash codes,” IEEE Transactions on Multimedia , vol. 15, no. 2, pp. 442–453, 2013
2013
Later among the works it cites.
Q. Wang, D. Zhang, and L. Si, “Weighted hashing for fast large scale similarity search,” in Proceedings of the 22nd ACM Conference on information and knowledge management , 2013, pp. 1185–1188
2013
Later among the works it cites.
L. Zhang, Y. Zhang, X. Gu, and Q. Tian, “Binary code ranking with weighted hamming distance,” in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition , Portland, Oregon, USA, 2013, pp. 1586–159
2013
Later among the works it cites.
X. Liu, J. He, B. Lang, and S.-F. Chang, “Hash bit selection: a unified solution for selection problems in hashing,” in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition , Portland, Oregon, USA, 2013, pp. 1570–1577
2013
Later among the works it cites.
Y. Gong, S. Lazebnik, A. Gordo, and F. Perronnin, “Iterative quantization: A procrustean approach to learning binary codes for large-scale image retrieval,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 35, no. 12, pp. 2916–2929, 2013
2013
Later among the works it cites.
S. Vijayanarasimhan, P. Jain, and K. Grauman, “Hashing hyperplane queries to near points with applications to large-scale active learning,” IEEE Transactions on Pattern Analysis and Machine Intelligence , 2013
2013
Later among the works it cites.
Y. Gong, S. Kumar, H. Rowley, and S. Lazebnik, “Learning binary codes for high-dimensional data using bilinear projections,” in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition , Portland, Oregon, USA, 2013, pp. 484–491
2013
Later among the works it cites.
X. Wang, S. Atev, J. Wright, and G. Lerman, “Fast subspace search via grassmannian based hashing,” in Proceedings of the IEEE International Conference on Computer Vision , 2013
2013
Later among the works it cites.
M. Rastegari, J. Choi, S. Fakhraei, D. Hal, and L. Davis, “Predictable dual-view hashing,” in Proceedings of the 30th International Conference on Machine Learning , 2013, pp. 1328–1336
2013
Later among the works it cites.
K. Grauman and R. Fergus, “Learning binary hash codes for large-scale image search,” in Machine Learning for Computer Vision . Springer, 2013, pp. 49–87
2013
Later among the works it cites.
X. Li, C. Shen, A. Dick, and A. van den Hengel, “Learning compact binary codes for visual tracking,” in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition , Portland, Oregon, USA, 2013, pp. 2419–2426
2013
Later among the works it cites.
M. Ou, P. Cui, F. Wang, J. Wang, W. Zhu, and S. Yang, “Comparing apples to oranges: A scalable solution with heterogeneous hashing,” in Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2013, pp. 230–238
2013
Later among the works it cites.
G. Ye, D. Liu, J. Wang, and S.-F. Chang, “Large-scale video hashing via structure learning,” in Proceedings of the IEEE International Conference on Computer Vision , 2013
2013
Later among the works it cites.
Q. Wang, D. Zhang, and L. Si, “Semantic hashing using tags and topic modeling,” in Proceedings of the 36th International ACM SIGIR Conference on Research and Development in Information Retrieval , 2013, pp. 213–222
2013
Later among the works it cites.
B. Qian, X. Wang, J. Wang, WeifengZhi, H. Li, and I. Davidson, “Fast pairwise query selection for large-scale active learning to rank,” in Proceedings of the IEEE International Conference on Data Mining , 2013
2013
Later among the works it cites.
F. Yu, S. Kumar, Y. Gong, and S.-F. Chang, “Circulant binary embedding,” in Proc. of ICML , Beijing, China, 2014, pp. 946–954
2014
Later among the works it cites.
W. Liu, C. Mu, S. Kumar, and S.-F. Chang, “Discrete graph hashing,” in Advances in Neural Information Processing Systems , 2014, pp. 3419–3427
2014
Later among the works it cites.
J. Masci, A. Bronstein, M. Bronstein, P. Sprechmann, and G. Sapiro, “Sparse similarity-preserving hashing,” in Proc. International Conference on Learning Representations , 2014
2014
Later among the works it cites.
R. Xia, Y. Pan, H. Lai, C. Liu, and S. Yan, “Supervised hashing for image retrieval via image representation learning,” in Proc. AAAI Conference on Artificial Intelligence , 2014, pp. 2156–2162
2014
Later among the works it cites.
H. Li, W. Liu, and H. Ji, “Two-stage hashing for fast document retrieval,” in Proceedings of the Annual Meeting of the Association for Computational Linguistics , Baltimore, Maryland, USA, 2014
2014
Later among the works it cites.
Y. Mu, G. Hua, W. Fan, and S.-F. Chang, “Hash-svm: Scalable kernel machines for large-scale visual classification,” in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition , Columbus, Ohio, USA, 2014, pp. 446–451
2014
Later among the works it cites.
F. Shen, C. Shen, W. Liu, and H. T. Shen, “Supervised discrete hashing,” in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition , Boston, Massachusetts, USA, 2015
2015
Closest in time.
M. Ou, P. Cui, F. Wang, J. Wang, and W. Zhu, “Non-transitive hashing with latent similarity components,” in Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2015, pp. 895–904
2015
Closest in time.
Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,” Nature , vol. 521, pp. 436–444, 2015
2015
Closest in time.
V. E. Liong, J. Lu, G. Wang, P. Moulin, and J. Zhou, “Deep hashing for compact binary codes learning,” in Proc. IEEE Conference on Computer Vision and Pattern Recognition , 2015
2015
Closest in time.
F. Zhao, Y. Huang, L. Wang, and T. Tan, “Deep semantic ranking based hashing for multi-label image retrieval,” in Proc. IEEE Conference on Computer Vision and Pattern Recognition , 2015
2015
Closest in time.
H. Lai, Y. Pan, Y. Liu, and S. Yan, “Simultaneous feature learning and hash coding with deep neural networks,” in Proc. IEEE Conference on Computer Vision and Pattern Recognition , 2015
2015
Closest in time.
W. Chen, J. T. Wilson, S. Tyree, K. Q. Weinberger, and Y. Chen, “Compressing neural networks with the hashing trick,” in Proc. International Conference on Machine Learning , 2015, pp. 2285–2294
2015
Closest in time.
M. Ou, P. Cui, J. Wang, F. Wang, and W. Zhu, “Probabilistic attributed hashing,” in Twenty-Ninth AAAI Conference on Artificial Intelligence , 2015, pp. 2894–2900
2015
Closest in time.
Q. Dai, J. Li, J. Wang, Y. Chen, and Y.-G. Jiang, “Optimal bayesian hashing for efficient face recognition,” in Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intellige , 2015, pp. 3430–3437
2015
Closest in time.
X. Zhang, L. Zhang, and H.-Y. Shum, “Qsrank: Query-sensitive hash code ranking for efficient ϵ \epsilon -neighbor search,” in IEEE Conference on Computer Vision and Pattern Recognition , Providence, RI, USA, 2012, pp. 2058–2065
2065
Closest in time.
W. Liu, J. Wang, R. Ji, Y.-G. Jiang, and S.-F. Chang, “Supervised hashing with kernels,” in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition , Providence, RI, USA, 2012, pp. 2074–2081
2081
Closest in time.