{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:59:51Z","timestamp":1742950791720,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540896883"},{"type":"electronic","value":"9783540896890"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89689-0_96","type":"book-chapter","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T12:32:14Z","timestamp":1228134734000},"page":"926-936","source":"Crossref","is-referenced-by-count":1,"title":["A Pruning Rule Based on a Distance Sparse Table for Hierarchical Similarity Search Algorithms"],"prefix":"10.1007","author":[{"given":"Eva","family":"Gomez-Ballester","sequence":"first","affiliation":[]},{"given":"Luisa","family":"Mic","sequence":"additional","affiliation":[]},{"given":"Jose","family":"Oncina","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"96_CR1","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., Marroquin, J.L.: Searching in metric spaces. ACM Computing Surveys\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"},{"key":"96_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-540-24586-5_56","volume-title":"Progress in Pattern Recognition, Speech and Image Analysis","author":"E. G\u00f3mez-Ballester","year":"2003","unstructured":"G\u00f3mez-Ballester, E., Mic\u00f3, L., Oncina, J.: Some improvements in tree based nearest neighbour search algorithms. In: Sanfeliu, A., Ruiz-Shulcloper, J. (eds.) CIARP 2003. LNCS, vol.\u00a02905, pp. 456\u2013463. Springer, Heidelberg (2003)"},{"issue":"1","key":"96_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-8655(94)90094-9","volume":"15","author":"E. Vidal","year":"1994","unstructured":"Vidal, E.: New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (aesa). Pattern Recognition Letters\u00a015(1), 1\u20137 (1994)","journal-title":"Pattern Recognition Letters"},{"key":"96_CR4","first-page":"1145","volume":"22","author":"F. Moreno-Seco","year":"2003","unstructured":"Moreno-Seco, F., Mic\u00f3, L., Oncina, J.: A modification of the laesa algorithm for approximated k-nn classification. Pattern Recognition Letters\u00a022, 1145\u20131151 (2003)","journal-title":"Pattern Recognition Letters"},{"key":"96_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-540-24586-5_39","volume-title":"Progress in Pattern Recognition, Speech and Image Analysis","author":"F. Moreno-Seco","year":"2003","unstructured":"Moreno-Seco, F., Mic\u00f3, L., Oncina, J.: Approximate nearest neighbour search with the fukunaga and narendra algorithm and its application to chromosome classification. In: Sanfeliu, A., Ruiz-Shulcloper, J. (eds.) CIARP 2003. LNCS, vol.\u00a02905, pp. 322\u2013328. Springer, Heidelberg (2003)"},{"issue":"1","key":"96_CR6","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s007780200060","volume":"11","author":"G. Navarro","year":"2002","unstructured":"Navarro, G.: Searching in metric spaces by spatial approximation. VLDB Journal\u00a011(1), 28\u201346 (2002)","journal-title":"VLDB Journal"},{"issue":"4","key":"96_CR7","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/958942.958948","volume":"28","author":"G.R. Hjaltason","year":"2003","unstructured":"Hjaltason, G.R., Samet, H.: Index-driven similarity search in metric spaces. ACM Trans. Database Syst.\u00a028(4), 517\u2013580 (2003)","journal-title":"ACM Trans. Database Syst."},{"key":"96_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-540-72849-8_39","volume-title":"Pattern Recognition and Image Analysis","author":"J. Oncina","year":"2007","unstructured":"Oncina, J., Thollard, F., G\u00f3mez-Ballester, E., Mic\u00f3, L., Moreno-Seco, F.: A tabular pruning rule in tree-based pruning rule fast nearest neighbour search algorithms. In: Mart\u00ed, J., Bened\u00ed, J.M., Mendon\u00e7a, A.M., Serrat, J. (eds.) IbPRIA 2007. LNCS, vol.\u00a04478, pp. 306\u2013313. Springer, Heidelberg (2007)"},{"key":"96_CR9","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"J.H. Friedman","year":"1977","unstructured":"Friedman, J.H., Bentley, J.L., Finkel, R.A.: An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software\u00a03, 209\u2013226 (1977)","journal-title":"ACM Transactions on Mathematical Software"},{"key":"96_CR10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.7551\/mitpress\/4908.003.0005","volume-title":"Nearest-Neighbor Methods for Learning and Vision: Theory and Practice","author":"K. Clarkson","year":"2006","unstructured":"Clarkson, K.: Nearest-neighbor searching and metric space dimensions. In: Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, pp. 15\u201359. MIT Press, Cambridge (2006)"},{"key":"96_CR11","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1109\/T-C.1975.224297","volume":"24","author":"K. Fukunaga","year":"1975","unstructured":"Fukunaga, K., Narendra, P.M.: A branch and bound algorithm for computing k-nearest neighbors. IEEE Transactions on Computers, IEC\u00a024, 750\u2013753 (1975)","journal-title":"IEEE Transactions on Computers, IEC"},{"key":"96_CR12","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","volume":"15","author":"L. Mic\u00f3","year":"1994","unstructured":"Mic\u00f3, L., Oncina, J., Vidal, E.: A new version of the nearest-neighbour approximating and eliminating search algorithm (aesa) with linear preprocessing time and memory requirements. Pattern Recognition Letters\u00a015, 9\u201317 (1994)","journal-title":"Pattern Recognition Letters"},{"key":"96_CR13","first-page":"426","volume-title":"Proceedings of the 23rd International Conference on VLDB","author":"P. Ciaccia","year":"1997","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: Proceedings of the 23rd International Conference on VLDB, Athens, Greece, pp. 426\u2013435. Morgan Kaufmann Publishers, San Francisco (1997)"},{"key":"96_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-29151-2","volume-title":"Similarity Search: The Metric Space Approach","author":"P. Zezula","year":"2006","unstructured":"Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach. Springer, Heidelberg (2006)"},{"unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 311\u2013321 (1993)","key":"96_CR15"},{"key":"96_CR16","volume-title":"Pattern Classification","author":"R.O. Duda","year":"2000","unstructured":"Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. Wiley, New York (2000)","edition":"2"},{"unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: Proceedings of the 21st International Conference on Very Large Data Bases, pp. 574\u2013584 (1995)","key":"96_CR17"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89689-0_96","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,4]],"date-time":"2024-03-04T01:39:19Z","timestamp":1709516359000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89689-0_96"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540896883","9783540896890"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89689-0_96","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}