{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:07:55Z","timestamp":1725746875426},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642410611"},{"type":"electronic","value":"9783642410628"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41062-8_10","type":"book-chapter","created":{"date-parts":[[2013,8,30]],"date-time":"2013-08-30T04:34:35Z","timestamp":1377837275000},"page":"91-102","source":"Crossref","is-referenced-by-count":6,"title":["Pivot Selection Strategies for Permutation-Based Similarity Search"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Amato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Esuli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Falchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Amato, G., Gennaro, C., Savino, P.: Mi-file: Using inverted files for scalable approximate similarity search. Multimedia Tools and Applications- An International Journal (November 2012) (online first)","DOI":"10.1007\/s11042-012-1271-1"},{"key":"10_CR2","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)","DOI":"10.4108\/ICST.INFOSCALE2008.3486"},{"key":"10_CR3","unstructured":"Batko, M., Falchi, F., Lucchese, C., Novak, D., Perego, R., Rabitti, F., Sedmidubsky, J., Zezula, P.: Building a web-scale image similarity search system. In: Multimedia Tools and Applications"},{"key":"10_CR4","unstructured":"Bolettieri, P., Esuli, A., Falchi, F., Lucchese, C., Perego, R., Piccioli, T., Rabitti, F.: Cophir: a test collection for content-based image retrieval. CoRR, abs\/0905.4627 (2009)"},{"key":"10_CR5","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: Proceedings of 21th International Conference on Very Large Data Bases, VLDB 1995, Zurich, Switzerland, September 11-15, pp. 574\u2013584. Morgan Kaufmann (1995)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Bustos, B., Pedreira, O., Brisaboa, N.: A dynamic pivot selection technique for similarity search. In: IEEE 24th International Conference on Data Engineering Workshop, ICDEW 2008, pp. 394\u2013401 (2008)","DOI":"10.1109\/ICDEW.2008.4498350"},{"issue":"14","key":"10_CR7","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 Recogn. Lett.\u00a024(14), 2357\u20132366 (2003)","journal-title":"Pattern Recogn. Lett."},{"issue":"9","key":"10_CR8","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."},{"key":"10_CR9","series-title":"LNCS(LNAI)","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-45435-7_24","volume-title":"Computational Learning Theory","author":"S. Dasgupta","year":"2002","unstructured":"Dasgupta, S.: Performance guarantees for hierarchical clustering. In: Kivinen, J., Sloan, R.H. (eds.) COLT 2002. LNCS(LNAI), vol.\u00a02375, pp. 351\u2013363. Springer, Heidelberg (2002)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Esuli, A.: Mipai: Using the pp-index to build an efficient and scalable similarity search system. In: SISAP, pp. 146\u2013148 (2009)","DOI":"10.1109\/SISAP.2009.14"},{"issue":"5","key":"10_CR11","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/j.ipm.2010.11.011","volume":"48","author":"A. Esuli","year":"2012","unstructured":"Esuli, A.: Use of permutation prefixes for efficient and scalable approximate similarity search. Information Processing & Management\u00a048(5), 889\u2013902 (2012)","journal-title":"Information Processing & Management"},{"key":"10_CR12","first-page":"28","volume-title":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2003","author":"R. Fagin","year":"2003","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Comparing top k lists. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2003, pp. 28\u201336. Society for Industrial and Applied Mathematics, Philadelphia (2003)"},{"key":"10_CR13","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proceedings of 25th International Conference on Very Large Data Bases, VLDB 1999, pp. 518\u2013529 (1999)"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T.F. Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci.\u00a038, 293\u2013306 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR15","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316801","volume-title":"Finding groups in data: an introduction to cluster analysis","author":"L. Kaufman","year":"1990","unstructured":"Kaufman, L., Rousseeuw, P.J.: Finding groups in data: an introduction to cluster analysis. John Wiley and Sons, New York (1990)"},{"key":"10_CR16","unstructured":"Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li Multi-probe, K.: lsh: efficient indexing for high-dimensional similarity search. In: Proceedings of the 33rd International Conference Very Large Data Bases, VLDB 2007, Vienna, Austria, pp. 950\u2013961 (2007)"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/1862344.1862349","volume-title":"Proceedings of the Third International Conference on SImilarity Search and APplications, SISAP 2010","author":"R. Mao","year":"2010","unstructured":"Mao, R., Miranker, W.L., Miranker, D.P.: Dimension reduction for distance-based indexing. In: Proceedings of the Third International Conference on SImilarity Search and APplications, SISAP 2010, pp. 25\u201332. ACM, New York (2010)"},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","volume":"15","author":"M.L. Mic\u00f3","year":"1994","unstructured":"Mic\u00f3, M.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 Recogn. Lett.\u00a015(1), 9\u201317 (1994)","journal-title":"Pattern Recogn. Lett."},{"issue":"4","key":"10_CR19","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/j.is.2010.10.002","volume":"36","author":"D. Novak","year":"2011","unstructured":"Novak, D., Batko, M., Zezula, P.: Metric index: An efficient and scalable solution for precise and approximate similarity search. Inf. Syst.\u00a036(4), 721\u2013733 (2011)","journal-title":"Inf. Syst."},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/1862344.1862354","volume-title":"Proceedings of the Third International Conference on SImilarity Search and APplications, SISAP 2010","author":"D. Novak","year":"2010","unstructured":"Novak, D., Kyselak, M., Zezula, P.: On locality-sensitive indexing in generic metric spaces. In: Proceedings of the Third International Conference on SImilarity Search and APplications, SISAP 2010, pp. 59\u201366. ACM, New York (2010)"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Paredes, R., Navarro, G.: Optimal incremental sorting. In: In Proc. 8th Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 171\u2013182. SIAM Press (2006)","DOI":"10.1137\/1.9781611972863.16"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-540-69507-3_37","volume-title":"SOFSEM 2007: Theory and Practice of Computer Science","author":"O. Pedreira","year":"2007","unstructured":"Pedreira, O., Brisaboa, N.R.: 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)"},{"issue":"5","key":"10_CR23","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/359581.359599","volume":"20","author":"M. Shapiro","year":"1977","unstructured":"Shapiro, M.: The choice of reference points in best-match file searching. Commun. ACM\u00a020(5), 339\u2013343 (1977)","journal-title":"Commun. ACM"},{"key":"10_CR24","first-page":"311","volume-title":"Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1993","author":"P.N. Yianilos","year":"1993","unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1993, pp. 311\u2013321. Society for Industrial and Applied Mathematics, Philadelphia (1993)"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search - The Metric Space Approach. Advances in Database Systems, vol.\u00a032, pp. 1\u2013191. Kluwer (2006)","DOI":"10.1007\/0-387-29151-2"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41062-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,22]],"date-time":"2019-07-22T17:11:59Z","timestamp":1563815519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41062-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642410611","9783642410628"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41062-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}