乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:42:53Z","timestamp":1725500573849},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775652"},{"type":"electronic","value":"9783540775669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77566-9_16","type":"book-chapter","created":{"date-parts":[[2008,1,5]],"date-time":"2008-01-05T01:18:43Z","timestamp":1199495923000},"page":"186-197","source":"Crossref","is-referenced-by-count":9,"title":["Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers"],"prefix":"10.1007","author":[{"given":"Nieves","family":"Brisaboa","sequence":"first","affiliation":[]},{"given":"Oscar","family":"Pedreira","sequence":"additional","affiliation":[]},{"given":"Diego","family":"Seco","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Solar","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Uribe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_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., Marroqu\u00edn, J.L.: Searching in metric spaces. ACM Computing Surveys\u00a033, 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity search. The metric space approach\u00a032 (2006)","DOI":"10.1007\/0-387-29151-2"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1145\/362003.362025","volume":"16","author":"W.A. Burkhard","year":"1973","unstructured":"Burkhard, W.A., Keller, R.M.: Some approaches to best-match file searching. Communications of the ACM\u00a016, 230\u2013236 (1973)","journal-title":"Communications of the ACM"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/3-540-58094-8_18","volume-title":"Combinatorial Pattern Matching","author":"R. Baeza-Yates","year":"1994","unstructured":"Baeza-Yates, R., Cunto, W., Manber, U., Wu, S.: Proximity matching using fixed-queries trees. In: Crochemore, M., Gusfield, D. (eds.) CPM 1994. LNCS, vol.\u00a0807, pp. 198\u2013212. Springer, Heidelberg (1994)"},{"key":"16_CR5","first-page":"331","volume":"37","author":"R. Baeza-Yates","year":"1997","unstructured":"Baeza-Yates, R.: Searching: an algorithmic tour. Encyclopedia of Computer Science and Technology\u00a037, 331\u2013359 (1997)","journal-title":"Encyclopedia of Computer Science and Technology"},{"key":"16_CR6","unstructured":"Ch\u00e1vez, E., Marroqu\u00edn, J.L., Navarro, G.: Overcoming the curse of dimensionality. In: CBMI 1999. European Workshop on Content-based Multimedia Indexing, pp. 57\u201364 (1999)"},{"key":"16_CR7","unstructured":"Yianilos, P.: Data structures and algorithms for nearest-neighbor search in general metric space. In: Proceedings of the fourth annual ACM-SIAM Symposium on Discrete Algorithms, pp. 311\u2013321 (1993)"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Bozkaya, T., Ozsoyoglu, M.: Distance-based indexing for high-dimensional metric spaces. In: SIGMOD 1997. Proceedings of the ACM International Conference on Management of Data, pp. 357\u2013368 (1997)","DOI":"10.1145\/253260.253345"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"ALENEX 1999","author":"P. Yianilos","year":"1999","unstructured":"Yianilos, P.: Excluded middle vantage point forests for nearest neighbor search. In: Goodrich, M.T., McGeoch, C.C. (eds.) ALENEX 1999. LNCS, vol.\u00a01619, Springer, Heidelberg (1999)"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","volume":"4","author":"E. Vidal","year":"1986","unstructured":"Vidal, E.: An algorithm for finding nearest neighbors in (aproximately) constant average time. Pattern Recognition Letters\u00a04, 145\u2013157 (1986)","journal-title":"Pattern Recognition Letters"},{"key":"16_CR11","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, R.E.: A new version of the nearest-neighbor approximating and eliminating search (aesa) with linear pre-processing time and memory requirements. Pattern Recognition Letters\u00a015, 9\u201317 (1994)","journal-title":"Pattern Recognition Letters"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1109\/TSE.1983.235263","volume":"9","author":"I. Kalantari","year":"1983","unstructured":"Kalantari, I., McDonald, G.: A data structure and an algorithm for the nearest point problem. IEEE Transactions on Software Engineering\u00a09, 631\u2013634 (1983)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"16_CR13","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, 175\u2013179 (1991)","journal-title":"Information Processing Letters"},{"key":"16_CR14","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: 21st conference on Very Large Databases (1995)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","first-page":"434","volume-title":"SOFSEM 2007","author":"N.R. Brisaboa","year":"2007","unstructured":"Brisaboa, N.R., Pedreira, O.: Spatial selection of sparse pivots for similarity search in metric spaces. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2007. LNCS, vol.\u00a04362, pp. 434\u2013445. Springer, Heidelberg (2007)"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/11758501_82","volume-title":"ICCS 2006","author":"R. Uribe","year":"2006","unstructured":"Uribe, R., Navarro, G., Barrientos, R.J., Mar\u00edn, M.: An index data structure for searching in metric space databases. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J.J. (eds.) ICCS 2006. LNCS, vol.\u00a03991, pp. 611\u2013617. Springer, Heidelberg (2006)"},{"issue":"14","key":"16_CR17","doi-asserted-by":"publisher","first-page":"2357","DOI":"10.1016\/S0167-8655(03)00065-5","volume":"24","author":"B. Bustos","year":"2003","unstructured":"Bustos, B., Navarro, G., Ch\u00e1vez, E.: Pivot selection techniques for proximity searching in metric spaces. Pattern Recognition Letters\u00a024(14), 2357\u20132366 (2003)","journal-title":"Pattern Recognition Letters"},{"key":"16_CR18","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: VLDB 1997. Proceedings of the 23rd International Conference on Very Large Data Bases, pp. 426\u2013435 (1997)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2008: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77566-9_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:10:10Z","timestamp":1606165810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77566-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540775652","9783540775669"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77566-9_16","relation":{},"subject":[]}}