{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T06:33:06Z","timestamp":1756189986330},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811068041"},{"type":"electronic","value":"9789811068058"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-981-10-6805-8_1","type":"book-chapter","created":{"date-parts":[[2017,10,25]],"date-time":"2017-10-25T04:13:04Z","timestamp":1508904784000},"page":"3-15","source":"Crossref","is-referenced-by-count":3,"title":["Locality-Sensitive Hashing for Finding Nearest Neighbors in Probability Distributions"],"prefix":"10.1007","author":[{"given":"Yi-Kun","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xian-Ling","family":"Mao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi-Jing","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heyan","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,26]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006, pp. 459\u2013468. IEEE (2006)","DOI":"10.1109\/FOCS.2006.49"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P., Nguyen, H.L., Razenshteyn, I.: Beyond locality-sensitive hashing. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1018\u20131028. SIAM (2014)","DOI":"10.1137\/1.9781611973402.76"},{"issue":"8","key":"1_CR3","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.1016\/S0169-7552(97)00031-7","volume":"29","author":"AZ Broder","year":"1997","unstructured":"Broder, A.Z., Glassman, S.C., Manasse, M.S., Zweig, G.: Syntactic clustering of the web. Comput. Netw. ISDN Syst. 29(8), 1157\u20131166 (1997)","journal-title":"Comput. Netw. ISDN Syst."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Charikar, M.S.: Similarity estimation techniques from rounding algorithms. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 380\u2013388. ACM (2002)","DOI":"10.1145\/509907.509965"},{"issue":"2","key":"1_CR5","first-page":"5","volume":"33","author":"A Chukllin","year":"2015","unstructured":"Chukllin, A., Schuth, A., Zhou, K., De Rijke, M.: A comparative analysis of interleaving methods for aggregated search. ACM Trans. Inf. Syst 33(2), 5 (2015)","journal-title":"ACM Trans. Inf. Syst"},{"key":"1_CR6","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 Twentieth Annual Symposium on Computational Geometry, pp. 253\u2013262. ACM (2004)","DOI":"10.1145\/997817.997857"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Eshghi, K., Rajaram, S.: Locality sensitive hash functions based on concomitant rank order statistics. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 221\u2013229. ACM (2008)","DOI":"10.1145\/1401890.1401921"},{"key":"1_CR8","unstructured":"Gilbert, S.: Linear algebra and its applications, Thomson, Brooks\/Cole, Belmont, CA. Technical report (2006). ISBN 0-030-10567-6"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Gong, Y., Lazebnik, S.: Comparing data-dependent and data-independent embeddings for classification and ranking of internet images. In: 2011 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 2633\u20132640. IEEE (2011)","DOI":"10.1109\/CVPR.2011.5995619"},{"issue":"2","key":"1_CR10","doi-asserted-by":"crossref","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 Trans. Pattern Anal. Mach. Intell. 34(2), 402\u2013409 (2012)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Hofmann, K., Whiteson, S., de Rijke, M.: A probabilistic method for inferring preferences from clicks. In: Proceedings of the 20th ACM International Conference on Information and Knowledge Management, pp. 249\u2013258. ACM (2011)","DOI":"10.1145\/2063576.2063618"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Hofmann, K., Whiteson, S., de Rijke, M.: Estimating interleaved comparison outcomes from historical click data. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management, pp. 1779\u20131783. ACM (2012)","DOI":"10.1145\/2396761.2398516"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 604\u2013613. ACM (1998)","DOI":"10.1145\/276698.276876"},{"key":"1_CR14","unstructured":"Jain, P., Vijayanarasimhan, S., Grauman, K.: Hashing hyperplane queries to near points with applications to large-scale active learning. In: Advances in Neural Information Processing Systems, pp. 928\u2013936 (2010)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Ji, J., Li, J., Yan, S., Tian, Q., Zhang, B.: Min-max hash for Jaccard similarity. In: 2013 IEEE 13th International Conference on Data Mining (ICDM), pp. 301\u2013309. IEEE (2013)","DOI":"10.1109\/ICDM.2013.119"},{"key":"1_CR16","unstructured":"Ji, J., Li, J., Yan, S., Zhang, B., Tian, Q.: Super-bit locality-sensitive hashing. In: Advances in Neural Information Processing Systems, pp. 108\u2013116 (2012)"},{"key":"1_CR17","unstructured":"Jiang, Q.Y., Li, W.J.: Scalable graph hashing with feature transformation. In: IJCAI (2015)"},{"key":"1_CR18","unstructured":"Kong, W., Li, W.J.: Isotropic hashing. In: Advances in Neural Information Processing Systems, pp. 1646\u20131654 (2012)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Kong, W., Li, W.J., Guo, M.: Manhattan hashing for large-scale image retrieval. In: Proceedings of the 35th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 45\u201354. ACM (2012)","DOI":"10.1145\/2348283.2348293"},{"issue":"6","key":"1_CR20","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1109\/TPAMI.2011.219","volume":"34","author":"B Kulis","year":"2012","unstructured":"Kulis, B., Grauman, K.: Kernelized locality-sensitive hashing. IEEE Trans. Pattern Anal. Mach. Intell. 34(6), 1092\u20131104 (2012)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Li, P., Konig, A., Gui, W.: B-bit minwise hashing for estimating three-way similarities. In: Advances in Neural Information Processing Systems, pp. 1387\u20131395 (2010)","DOI":"10.1145\/1772690.1772759"},{"key":"1_CR22","unstructured":"Li, P., Owen, A., Zhang, C.H.: One permutation hashing. In: Advances in Neural Information Processing Systems, pp. 3113\u20133121 (2012)"},{"key":"1_CR23","unstructured":"Liu, W., Mu, C., Kumar, S., Chang, S.F.: Discrete graph hashing. In: Advances in Neural Information Processing Systems, pp. 3419\u20133427 (2014)"},{"issue":"9","key":"1_CR24","doi-asserted-by":"crossref","first-page":"745","DOI":"10.14778\/2732939.2732947","volume":"7","author":"Y Liu","year":"2014","unstructured":"Liu, Y., Cui, J., Huang, Z., Li, H., Shen, H.T.: SK-LSH: an efficient index structure for approximate nearest neighbor search. Proc. VLDB Endowment 7(9), 745\u2013756 (2014)","journal-title":"Proc. VLDB Endowment"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Mu, Y., Yan, S.: Non-metric locality-sensitive hashing. In: AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7683"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"ODonnell, R., Wu, Y., Zhou, Y.: Optimal lower bounds for locality-sensitive hashing (except when q is tiny). ACM Trans. Comput. Theor. (TOCT) 6(1), 5 (2014)","DOI":"10.1145\/2578221"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-73951-7_4","volume-title":"Algorithms and Data Structures","author":"K Terasawa","year":"2007","unstructured":"Terasawa, K., Tanaka, Y.: Spherical LSH for approximate nearest neighbor search on unit hypersphere. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 27\u201338. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-73951-7_4"},{"key":"1_CR28","unstructured":"Wang, J., Shen, H.T., Song, J., Ji, J.: Hashing for similarity search: a survey. arXiv preprint arXiv:1408.2927 (2014)"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Zhang, T., Qi, G.J., Tang, J., Wang, J.: Sparse composite quantization. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 4548\u20134556 (2015)","DOI":"10.1109\/CVPR.2015.7299085"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Zhao, W.L., J\u00e9gou, H., Gravier, G.: Sim-Min-Hash: an efficient matching technique for linking large image collections. In: Proceedings of the 21st ACM International Conference on Multimedia, pp. 577\u2013580. ACM (2013)","DOI":"10.1145\/2502081.2502152"}],"container-title":["Communications in Computer and Information Science","Social Media Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-6805-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T14:30:33Z","timestamp":1693146633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-6805-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9789811068041","9789811068058"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-6805-8_1","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]}}}