{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T01:36:50Z","timestamp":1725845810402},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319276731"},{"type":"electronic","value":"9783319276748"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-27674-8_10","type":"book-chapter","created":{"date-parts":[[2015,12,31]],"date-time":"2015-12-31T14:47:31Z","timestamp":1451573251000},"page":"104-115","source":"Crossref","is-referenced-by-count":1,"title":["SELSH: A Hashing Scheme for Approximate Similarity Search with Early Stop Condition"],"prefix":"10.1007","author":[{"given":"Jie","family":"Chen","sequence":"first","affiliation":[]},{"given":"Chengkun","family":"He","sequence":"additional","affiliation":[]},{"given":"Gang","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Shao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,1]]},"reference":[{"issue":"9","key":"10_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"10_CR2","unstructured":"Berchtold, S., B\u00f6hm, C., Kriegel, H.: The pyramid-technique: towards breaking the curse of dimensionality. In: SIGMOD 1998, Proceedings ACM SIGMOD International Conference on Management of Data, June 2\u20134, 1998, Seattle, pp. 142\u2013153 (1998)"},{"issue":"3","key":"10_CR3","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C B\u00f6hm","year":"2001","unstructured":"B\u00f6hm, C., Berchtold, S., Keim, D.A.: Searching in high-dimensional spaces: index structures for improving the performance of multimedia databases. ACM Comput. Surv. 33(3), 322\u2013373 (2001)","journal-title":"ACM Comput. Surv."},{"key":"10_CR4","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: VLDB 1997, Proceedings of 23rd International Conference on Very Large Data Bases, Athens, 25\u201329 August, 1997, pp. 426\u2013435 (1997)"},{"key":"10_CR5","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 20th ACM Symposium on Computational Geometry, Brooklyn, New York, 8\u201311 June, 2004, pp. 253\u2013262 (2004)","DOI":"10.1145\/997817.997857"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Gan, J., Feng, J., Fang, Q., Ng, W.: Locality-sensitive hashing scheme based on dynamic collision counting. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2012, Scottsdale, 20\u201324 May, 2012, pp. 541\u2013552 (2012)","DOI":"10.1145\/2213836.2213898"},{"key":"10_CR7","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: VLDB 1999, Proceedings of 25th International Conference on Very Large Data Bases, Edinburgh, 7\u201310 September, 1999, pp. 518\u2013529 (1999)"},{"key":"10_CR8","unstructured":"G\u00fcnther, O.: The design of the cell tree: an object-oriented index structure for geometric databases. In: Proceedings of the Fifth International Conference on Data Engineering, Los Angeles, 6\u201310 February, 1989, pp. 598\u2013605 (1989)"},{"key":"10_CR9","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 the Theory of Computing, Dallas, 23\u201326 May, 1998, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"issue":"2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"HV Jagadish","year":"2005","unstructured":"Jagadish, H.V., Ooi, B.C., Tan, K., Yu, C., Zhang, R.: iDistance: an adaptive b $${}^{\\text{+ }}$$ + -tree based indexing method for nearest neighbor search. ACM Trans. Database Syst. 30(2), 364\u2013397 (2005)","journal-title":"ACM Trans. Database Syst."},{"issue":"9","key":"10_CR11","first-page":"745","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. PVLDB 7(9), 745\u2013756 (2014)","journal-title":"PVLDB"},{"key":"10_CR12","unstructured":"Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li, K.: Multi-probe LSH: efficient indexing for high-dimensional similarity search. In: Proceedings of the 33rd International Conference on Very Large Data Bases, University of Vienna, Austria, 23\u201327 September, 2007, pp. 950\u2013961 (2007)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Shen, F., Shen, C., Shi, Q., van den Hengel, A., Tang, Z.: Inductive hashing on manifolds. In: 2013 IEEE Conference on Computer Vision and Pattern Recognition, Portland, 23\u201328 June, 2013, pp. 1562\u20131569 (2013)","DOI":"10.1109\/CVPR.2013.205"},{"issue":"6","key":"10_CR14","doi-asserted-by":"publisher","first-page":"1839","DOI":"10.1109\/TIP.2015.2405340","volume":"24","author":"F Shen","year":"2015","unstructured":"Shen, F., Shen, C., Shi, Q., van den Hengel, A., Tang, Z., Shen, H.T.: Hashing on nonlinear manifolds. IEEE Trans. Image Process. 24(6), 1839\u20131851 (2015)","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"10_CR15","first-page":"1","volume":"8","author":"Y Sun","year":"2014","unstructured":"Sun, Y., Wang, W., Qin, J., Zhang, Y., Lin, X.: SRS: solving c-approximate nearest neighbor queries in high dimensional euclidean space with a tiny index. PVLDB 8(1), 1\u201312 (2014)","journal-title":"PVLDB"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Tao, Y., Yi, K., Sheng, C., Kalnis, P.: Efficient and accurate nearest neighbor and closest pair search in high-dimensional space. ACM Trans. Database Syst., 35(3) (2010)","DOI":"10.1145\/1806907.1806912"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Weber, R., B\u00f6hm, K., Schek, H.: Interactive-time similarity search for large image collections using parallel va-files. In: ICDE. p. 197 (2000)","DOI":"10.1007\/3-540-45268-0_8"}],"container-title":["Lecture Notes in Computer Science","MultiMedia Modeling"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27674-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T03:06:04Z","timestamp":1567479964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27674-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319276731","9783319276748"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27674-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}