{"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":1725806718471},"publisher-location":"Cham","reference-count":20,"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_8","type":"book-chapter","created":{"date-parts":[[2014,10,8]],"date-time":"2014-10-08T13:15:40Z","timestamp":1412774140000},"page":"82-93","source":"Crossref","is-referenced-by-count":4,"title":["Large-Scale Distributed Locality-Sensitive Hashing for General Metric Data"],"prefix":"10.1007","author":[{"given":"Eliezer","family":"Silva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thiago","family":"Teixeira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Teodoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Valle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroqu\u00edn, J.L.: Searching in metric spaces 33(3), 273\u2013321 (September 2001)","DOI":"10.1145\/502807.502808"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Akune, F., Valle, E., Torres, R.: MONORAIL: A Disk-Friendly Index for Huge Descriptor Databases. In: 20th Int. Conf. on Pattern Recognition, pp. 4145\u20134148. IEEE (August 2010)","DOI":"10.1109\/ICPR.2010.1008"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proc. of 13th Ann. ACM Symp. on Theory of Comp., pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"8_CR4","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proc. of the 25th Int. Conf. on Very Large Data Bases, pp. 518\u2013529 (1999)"},{"key":"8_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: Proc. of the 20th Ann. Symp. on Computational Geometry, p. 253 (2004)","DOI":"10.1145\/997817.997857"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Paulev\u00e9, L., J\u00e9gou, H., Amsaleg, L.: Locality sensitive hashing: A comparison of hash function types and querying mechanisms\u00a031(11), 1348\u20131358 (August 2010)","DOI":"10.1016\/j.patrec.2010.04.004"},{"key":"8_CR7","unstructured":"Kang, B., Jung, K.: Robust and Efficient Locality Sensitive Hashing for Nearest Neighbor Search in Large Data Sets. In: NIPS Workshop on Big Learning (BigLearn), Lake Tahoe, Nevada, pp. 1\u20138 (2012)"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/1862344.1862355","volume-title":"Proc. of the Third Int. Conf. on Similarity Search and Applications, SISAP 2010","author":"E.S. Tellez","year":"2010","unstructured":"Tellez, E.S., Chavez, E.: On locality sensitive hashing in metric spaces. In: Proc. of the Third Int. Conf. on Similarity Search and Applications, SISAP 2010, pp. 67\u201374. ACM, New York (2010)"},{"key":"8_CR9","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. Springer (2006)","DOI":"10.1007\/0-387-29151-2"},{"key":"8_CR10","unstructured":"Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li, K.: Multi-probe LSH: efficient indexing for high-dimensional similarity search. In: Proc. of the 33rd Int. Conf. on Very large data bases. VLDB 2007, pp. 950\u2013961. VLDB Endowment (2007)"},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/1459359.1459388","volume-title":"Proc. of the 16th ACM Int. Conf. on Multimedia, MM 2008","author":"A. Joly","year":"2008","unstructured":"Joly, A., Buisson, O.: A posteriori multi-probe locality sensitive hashing. In: Proc. of the 16th ACM Int. Conf. on Multimedia, MM 2008, pp. 209\u2013218. ACM, New York (2008)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Novak, D., Batko, M.: Metric Index: An Efficient and Scalable Solution for Similarity Search. In: 2009 Second Int. Workshop on Similarity Search and Applications, pp. 65\u201373. IEEE Computer Society (August 2009)","DOI":"10.1109\/SISAP.2009.26"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/1862344.1862354","volume-title":"Proc. of the Third Int. Conf. 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: Proc. of the Third Int. Conf. on Similarity Search and Applications, SISAP 2010, pp. 59\u201366. ACM Press, New York (2010)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Rabani, Y., Schulman, L., Swamy, C.: The Effectiveness of Lloyd-Type Methods for the k-Means Problem. In: Focs, pp. 165\u2013176. IEEE (December 2006)","DOI":"10.1109\/FOCS.2006.75"},{"key":"8_CR15","unstructured":"Arthur, D., Vassilvitskii, S.: K-means++: the advantages of careful seeding. In: Proc. of the 18th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA 2007, Philadelphia, PA, USA, pp. 1027\u20131035 (2007)"},{"key":"8_CR16","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, 9th edn. Wiley-Interscience, New York (1990)","edition":"9"},{"key":"8_CR17","unstructured":"Paterlini, A.A., Nascimento, M.A., Junior, C.T.: Using Pivots to Speed-Up k-Medoids Clustering 2(2), 221\u2013236 (June 2011)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Park, H.S., Jun, C.H.: A simple and fast algorithm for K-medoids clustering 36(2), 3336\u20133341 (2009)","DOI":"10.1016\/j.eswa.2008.01.039"},{"key":"8_CR19","unstructured":"Figueroa, K., Navarro, G., Ch\u00e1vez, E.: Metric spaces library (2007), http:\/\/www.sisap.org\/Metric_Space_Library.html"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Jegou, H., Tavenard, R., Douze, M., Amsaleg, L.: Searching in one billion vectors: Re-rank with source coding. In: ICASSP, pp. 861\u2013864. IEEE (2011)","DOI":"10.1109\/ICASSP.2011.5946540"}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,19]],"date-time":"2022-04-19T11:40:29Z","timestamp":1650368429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11988-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319119878","9783319119885"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11988-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}