{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:45:18Z","timestamp":1725806718761},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319119878"},{"type":"electronic","value":"9783319119885"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-11988-5_16","type":"book-chapter","created":{"date-parts":[[2014,10,8]],"date-time":"2014-10-08T09:15:40Z","timestamp":1412759740000},"page":"176-188","source":"Crossref","is-referenced-by-count":0,"title":["High Dimensional Search Using Polyhedral Query"],"prefix":"10.1007","author":[{"given":"Richard","family":"Connor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stewart","family":"MacKenzie-Leigh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Moss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Amato, G., Esuli, A., Falchi, F.: Pivot selection strategies for permutation-based similarity search. In: Brisaboa, et al. (eds.) [3], pp. 91\u2013102","key":"16_CR1","DOI":"10.1007\/978-3-642-41062-8_10"},{"doi-asserted-by":"crossref","unstructured":"Amato, G., Savino, P.: Approximate similarity search in metric spaces using inverted files. In: Proceedings of the 3rd International Conference on Scalable Information Systems, InfoScale 2008, pp. 28:1\u201328:10. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), Brussels (2008)","key":"16_CR2","DOI":"10.4108\/ICST.INFOSCALE2008.3486"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Similarity Search and Applications","year":"2013","unstructured":"Brisaboa, N., Pedreira, O., Zezula, P. (eds.): SISAP 2013. LNCS, vol.\u00a08199. Springer, Heidelberg (2013)"},{"issue":"9","key":"16_CR4","doi-asserted-by":"publisher","first-page":"1647","DOI":"10.1109\/TPAMI.2007.70815","volume":"30","author":"E. Ch\u00e1vez","year":"2008","unstructured":"Ch\u00e1vez, E., Figueroa, K., Navarro, G.: Effective proximity retrieval by ordering permutations. IEEE Trans. Pattern Anal. Mach. Intell.\u00a030(9), 1647\u20131658 (2008)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(02)00344-7","volume":"85","author":"E. Ch\u00e1vez","year":"2003","unstructured":"Ch\u00e1vez, E., Navarro, G.: Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces. Inf. Process. Lett.\u00a085(1), 39\u201346 (2003)","journal-title":"Inf. Process. Lett."},{"issue":"9","key":"16_CR6","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1016\/j.patrec.2004.11.014","volume":"26","author":"E. Ch\u00e1vez","year":"2005","unstructured":"Ch\u00e1vez, E., Navarro, G.: A compact space decomposition for effective metric indexing. Pattern Recognition Letters\u00a026(9), 1363\u20131376 (2005)","journal-title":"Pattern Recognition Letters"},{"issue":"3","key":"16_CR7","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroqu\u00edn, J.L.: Searching in metric spaces. ACM Comput. Surv.\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Comput. Surv."},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-32153-5_15","volume-title":"Similarity Search and Applications","author":"R. Connor","year":"2012","unstructured":"Connor, R., Moss, R.: A multivariate correlation distance for vector spaces. In: Navarro, G., Pestov, V. (eds.) SISAP 2012. LNCS, vol.\u00a07404, pp. 209\u2013225. Springer, Heidelberg (2012)"},{"issue":"4","key":"16_CR9","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1016\/j.is.2010.12.003","volume":"36","author":"R. Connor","year":"2011","unstructured":"Connor, R., Simeoni, F., Iakovos, M., Moss, R.: A bounded distance metric for comparing tree structure. Inf. Syst.\u00a036(4), 748\u2013764 (2011)","journal-title":"Inf. Syst."},{"doi-asserted-by":"crossref","unstructured":"Figueroa, K., Frediksson, K.: Speeding up permutation based indexing with indexing. In: Second International Workshop on Similarity Search and Applications, SISAP 2009, pp. 107\u2013114 (August 2009)","key":"16_CR10","DOI":"10.1109\/SISAP.2009.12"},{"doi-asserted-by":"crossref","unstructured":"Huiskes, M.J., Lew, M.S.: The mir flickr retrieval evaluation. In: MIR 2008: Proceedings of the 2008 ACM International Conference on Multimedia Information Retrieval. ACM, New York (2008)","key":"16_CR11","DOI":"10.1145\/1460096.1460104"},{"doi-asserted-by":"crossref","unstructured":"Mohamed, H., Marchand-Maillet, S.: Quantized ranking for permutation-based indexing. In: Brisaboa, et al. (eds.) [3], pp. 103\u2013114","key":"16_CR12","DOI":"10.1007\/978-3-642-41062-8_11"},{"issue":"3","key":"16_CR13","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1023\/A:1011139631724","volume":"42","author":"A. Oliva","year":"2001","unstructured":"Oliva, A., Torralba, A.: Modeling the shape of the scene: A holistic representation of the spatial envelope. Int. J. Comput. Vision\u00a042(3), 145\u2013175 (2001)","journal-title":"Int. J. Comput. Vision"},{"issue":"1","key":"16_CR14","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.jda.2008.09.014","volume":"7","author":"M. Patella","year":"2009","unstructured":"Patella, M., Ciaccia, P.: Approximate similarity search: A multi-faceted problem. J. of Discrete Algorithms\u00a07(1), 36\u201348 (2009)","journal-title":"J. of Discrete Algorithms"},{"issue":"3","key":"16_CR15","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","volume":"4","author":"E.V. Ruiz","year":"1986","unstructured":"Ruiz, E.V.: An algorithm for finding nearest neighbours in (approximately) constant average time. Pattern Recognition Letters\u00a04(3), 145\u2013157 (1986)","journal-title":"Pattern Recognition Letters"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-41062-8_12","volume-title":"Similarity Search and Applications","author":"G. Ruiz","year":"2013","unstructured":"Ruiz, G., Santoyo, F., Ch\u00e1vez, E., Figueroa, K., Tellez, E.S.: Extreme pivots for faster metric indexes. In: Brisaboa, N., Pedreira, O., Zezula, P. (eds.) SISAP 2013. LNCS, vol.\u00a08199, pp. 115\u2013126. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11988-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T17:33:07Z","timestamp":1580319187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11988-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319119878","9783319119885"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11988-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}