{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:04:43Z","timestamp":1786979083402,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642387081","type":"print"},{"value":"9783642387098","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40991-2_42","type":"book-chapter","created":{"date-parts":[[2013,8,28]],"date-time":"2013-08-28T01:43:57Z","timestamp":1377654237000},"page":"660-674","source":"Crossref","is-referenced-by-count":48,"title":["Fast kNN Graph Construction with Locality Sensitive Hashing"],"prefix":"10.1007","author":[{"given":"Yan-Ming","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kaizhu","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guanggang","family":"Geng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cheng-Lin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"6","key":"42_CR1","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1162\/089976603321780317","volume":"15","author":"M. Belkin","year":"2003","unstructured":"Belkin, M., Niyogi, P.: Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation\u00a015(6), 1373\u20131396 (2003)","journal-title":"Neural Computation"},{"issue":"9","key":"42_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Communications of the ACM\u00a018(9), 509\u2013517 (1975)","journal-title":"Communications of the ACM"},{"issue":"4","key":"42_CR3","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"J.L. Bentley","year":"1980","unstructured":"Bentley, J.L.: Multidimensional divide-and-conquer. Communications of the ACM\u00a023(4), 214\u2013229 (1980)","journal-title":"Communications of the ACM"},{"issue":"1","key":"42_CR4","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/TPAMI.2011.103","volume":"34","author":"M.M. Bronstein","year":"2012","unstructured":"Bronstein, M.M., Fua, P.: LDAHash: Improved matching with smaller descriptors. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a034(1), 66\u201378 (2012)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Charikar, M.S.: Similarity estimation techniques from rounding algorithms. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing (2002)","DOI":"10.1145\/509961.509965"},{"key":"42_CR6","first-page":"1989","volume":"10","author":"J. Chen","year":"2009","unstructured":"Chen, J., Fang, H., Saad, Y.: Fast approximate kNN graph construction for high dimensional data via recursive lanczos bisection. The Journal of Machine Learning Research\u00a010, 1989\u20132012 (2009)","journal-title":"The Journal of Machine Learning Research"},{"key":"42_CR7","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1109\/TIP.2009.2038764","volume":"19","author":"B. Cheng","year":"2010","unstructured":"Cheng, B., Yang, J.C., Yan, S.C., Fu, Y., Huang, T.: Learning with l1-graph for image analysis. IEEE Transaction on Image Processing\u00a019, 858\u2013866 (2010)","journal-title":"IEEE Transaction on Image Processing"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Chua, T.-S., Tang, J., Hong, R., Li, H., Luo, Z., Zheng, Y.-T.: NUS-WIDE: A real-world web image database from national university of singapore. In: Proceedings of ACM Conference on Image and Video Retrieval (2009)","DOI":"10.1145\/1646396.1646452"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Daitch, S.I., Kelner, J.A., Spielman, D.A.: Fitting a graph to vector data. In: Proceedings of the International Conference on Machine Learning (2009)","DOI":"10.1145\/1553374.1553400"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the Annual Symposium on Computational Geometry (2004)","DOI":"10.1145\/997817.997857"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Deng, J., Dong, W., Socher, R., Li, L.-J., Li, K., Fei-Fei, L.: ImageNet: A Large-Scale Hierarchical Image Database. In: IEEE Conference on Computer Vision and Pattern Recognition (2009)","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Dong, W., Charikar, M., Li, K.: Efficient k-nearest neighbor graph construction for generic similarity measures. In: Proceedings of the International Conference on World Wide Web (2011)","DOI":"10.1145\/1963405.1963487"},{"key":"42_CR13","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proceedings of the International Conference on Very Large Data Bases (1999)"},{"issue":"2","key":"42_CR14","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1109\/TPAMI.2011.193","volume":"34","author":"D. Gorisse","year":"2012","unstructured":"Gorisse, D., Cord, M., Precioso, F.: Locality-sensitive hashing for chi2 distance. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a034(2), 402\u2013409 (2012)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"42_CR15","unstructured":"Goyal, A., Daum\u00e9 III, H., Guerra, R.: Fast large-scale approximate graph construction for nlp. In: Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (2012)"},{"key":"42_CR16","unstructured":"Griffin, G., Holub, A., Perona, P.: Caltech-256 object category dataset. Technical report, California Institute of Technology (2007)"},{"key":"42_CR17","unstructured":"Herbster, M., Pontil, M., Galeano, S.R.: Fast predciton on a tree. In: Advances in Neural Information Processing Systems (2008)"},{"key":"42_CR18","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Annual ACM Symposium on Theory of Computing (1998)","DOI":"10.1145\/276698.276876"},{"key":"42_CR19","doi-asserted-by":"crossref","unstructured":"Jebara, T., Wang, J., Chang, S.F.: Graph construction and b-matching for semi-supervised learning. In: Proceedings of the International Conference on Machine Learning (2009)","DOI":"10.1145\/1553374.1553432"},{"key":"42_CR20","unstructured":"Kong, W., Li, W.J.: Isotropic hashing. In: Advances in Neural Information Processing Systems (2012)"},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"Kulis, B., Grauman, K.: Kernelized locality-sensitive hashing for scalable image search. In: IEEE International Conference on Computer Vision (2009)","DOI":"10.1109\/ICCV.2009.5459466"},{"issue":"12","key":"42_CR22","doi-asserted-by":"publisher","first-page":"2143","DOI":"10.1109\/TPAMI.2009.151","volume":"31","author":"B. Kulis","year":"2009","unstructured":"Kulis, B., Jain, P., Grauman, K.: Fast similarity search for learned metrics. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a031(12), 2143\u20132157 (2009)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"42_CR23","unstructured":"Liu, W., Wang, J., Kumar, S., Chang, S.F.: Hashing with graphs. In: Proceedings of the International Conference on Machine Learning (2011)"},{"issue":"7","key":"42_CR24","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1016\/j.ijar.2008.11.006","volume":"50","author":"R. Salakhutdinov","year":"2009","unstructured":"Salakhutdinov, R., Hinton, G.: Semantic hashing. International Journal of Approximate Reasoning\u00a050(7), 969\u2013978 (2009)","journal-title":"International Journal of Approximate Reasoning"},{"issue":"8","key":"42_CR25","first-page":"888","volume":"22","author":"J. Shi","year":"2002","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a022(8), 888\u2013905 (2002)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"4","key":"42_CR26","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J.K. Uhlmann","year":"1991","unstructured":"Uhlmann, J.K.: Satisfying general proximity\/similarity queries with metric trees. Information Processing Letters\u00a040(4), 175\u2013179 (1991)","journal-title":"Information Processing Letters"},{"issue":"1","key":"42_CR27","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02187718","volume":"4","author":"P.M. Vaidya","year":"1989","unstructured":"Vaidya, P.M.: An O(nlogn) algorithm for the all-nearest-neighbors problem. Discrete & Computational Geometry\u00a04(1), 101\u2013115 (1989)","journal-title":"Discrete & Computational Geometry"},{"issue":"4","key":"42_CR28","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U. Luxburg Von","year":"2007","unstructured":"Von Luxburg, U.: A tutorial on spectral clustering. Statistics and Computing\u00a017(4), 395\u2013416 (2007)","journal-title":"Statistics and Computing"},{"key":"42_CR29","doi-asserted-by":"crossref","unstructured":"Wang, J., Kumar, S., Chang, S.F.: Semi-supervised hashing for scalable image retrieval. In: IEEE Conference on Computer Vision and Pattern Recognition (2010)","DOI":"10.1109\/CVPR.2010.5539994"},{"key":"42_CR30","unstructured":"Wang, J., Wang, J., Zeng, G., Tu, Z., Gan, R., Li, S.: Scalable k-NN graph construction for visual descriptors. In: IEEE Conference on Computer Vision and Pattern Recognition (2012)"},{"key":"42_CR31","unstructured":"Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: Advances in Neural Information Processing Systems (2008)"},{"key":"42_CR32","doi-asserted-by":"crossref","unstructured":"Zhang, Y.M., Huang, K., Liu, C.L.: Fast and robust graph-based transductive learning via minimum tree cut. In: IEEE International Conference on Data Mining (2011)","DOI":"10.1109\/ICDM.2011.66"},{"key":"42_CR33","unstructured":"Zhu, X.: Semi-supervised learning literature survey. Technical report, Computer Science, University of Wisconsin-Madison (2008)"},{"key":"42_CR34","unstructured":"Zhu, X., Ghahramani, Z., Lafferty, J.: Semi-supervised learning using Gaussian fields and harmonic functions. In: Proceedings of the International Conference on Machine Learning (2003)"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40991-2_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T19:39:12Z","timestamp":1558035552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40991-2_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387081","9783642387098"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40991-2_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}