{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:13:46Z","timestamp":1755839626948,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031469930"},{"type":"electronic","value":"9783031469947"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-46994-7_4","type":"book-chapter","created":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T07:02:16Z","timestamp":1698303736000},"page":"41-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An Alternating Optimization Scheme for\u00a0Binary Sketches for\u00a0Cosine Similarity Search"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1639-3534","authenticated-orcid":false,"given":"Erik","family":"Thordsen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9143-4880","authenticated-orcid":false,"given":"Erich","family":"Schubert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,27]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Balu, R., Furon, T., J\u00e9gou, H.: Beyond \u201cproject and sign\u201d for cosine estimation with binary codes. In: IEEE International Conference Acoustics, Speech and Signal Processing, ICASSP, pp. 6884\u20136888 (2014). https:\/\/doi.org\/10.1109\/ICASSP.2014.6854934","key":"4_CR1","DOI":"10.1109\/ICASSP.2014.6854934"},{"doi-asserted-by":"publisher","unstructured":"Black, J., Rogaway, P.: Ciphers with arbitrary finite domains. In: Topics in Cryptology, CT-RSA, pp. 114\u2013130 (2002). https:\/\/doi.org\/10.1007\/3-540-45760-7_9","key":"4_CR2","DOI":"10.1007\/3-540-45760-7_9"},{"doi-asserted-by":"publisher","unstructured":"Charikar, M.: Similarity estimation techniques from rounding algorithms. In: Symposium Theory of Computing, pp. 380\u2013388 (2002). https:\/\/doi.org\/10.1145\/509907.509965","key":"4_CR3","DOI":"10.1145\/509907.509965"},{"issue":"6","key":"4_CR4","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/358669.358692","volume":"24","author":"MA Fischler","year":"1981","unstructured":"Fischler, M.A., Bolles, R.C.: Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Commun. ACM 24(6), 381\u2013395 (1981). https:\/\/doi.org\/10.1145\/358669.358692","journal-title":"Commun. ACM"},{"doi-asserted-by":"publisher","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Very Large Data Bases, VLDB, pp. 518\u2013529 (1999). https:\/\/doi.org\/10.5555\/645925.671516","key":"4_CR5","DOI":"10.5555\/645925.671516"},{"doi-asserted-by":"publisher","unstructured":"Hamerly, G.: Making k-means even faster. In: Proceedings of SIAM Data Mining, SDM, pp. 130\u2013140 (2010). https:\/\/doi.org\/10.1137\/1.9781611972801.12","key":"4_CR6","DOI":"10.1137\/1.9781611972801.12"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"12","DOI":"10.14714\/CP59.245","volume":"59","author":"B Jenny","year":"2008","unstructured":"Jenny, B., Patterson, T., Hurni, L.: Flex projector-interactive software for designing world map projections. Cartographic Perspect. 59, 12\u201327 (2008). https:\/\/doi.org\/10.14714\/CP59.245","journal-title":"Cartographic Perspect."},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1109\/TBDATA.2019.2921572","volume":"7","author":"J Johnson","year":"2019","unstructured":"Johnson, J., Douze, M., J\u00e9gou, H.: Billion-scale similarity search with GPUs. IEEE Trans. Big Data 7(3), 535\u2013547 (2019). https:\/\/doi.org\/10.1109\/TBDATA.2019.2921572","journal-title":"IEEE Trans. Big Data"},{"issue":"4","key":"4_CR9","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TPAMI.2018.2889473","volume":"42","author":"YA Malkov","year":"2018","unstructured":"Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Trans. Pattern Anal. Mach. Intell. 42(4), 824\u2013836 (2018). https:\/\/doi.org\/10.1109\/TPAMI.2018.2889473","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"doi-asserted-by":"publisher","unstructured":"Mic, V., Novak, D., Vadicamo, L., Zezula, P.: Selecting sketches for similarity search. In: Advance Databases and Information Systems, ADBIS, pp. 127\u2013141 (2018). https:\/\/doi.org\/10.1007\/978-3-319-98398-1_9","key":"4_CR10","DOI":"10.1007\/978-3-319-98398-1_9"},{"unstructured":"Mic, V., Novak, D., Zezula, P.: Improving sketches for similarity search. In: Proceedings of MEMICS, pp. 130\u2013140 (2015)","key":"4_CR11"},{"doi-asserted-by":"publisher","unstructured":"Mic, V., Novak, D., Zezula, P.: Sketches with unbalanced bits for similarity search. In: Similarity Search and Applications, SISAP, pp. 53\u201363 (2017). https:\/\/doi.org\/10.1007\/978-3-319-68474-1_4","key":"4_CR12","DOI":"10.1007\/978-3-319-68474-1_4"},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/s00454-013-9561-6","volume":"51","author":"Y Plan","year":"2014","unstructured":"Plan, Y., Vershynin, R.: Dimension reduction by random hyperplane tessellations. Discret. Comput. Geom. 51(2), 438\u2013461 (2014). https:\/\/doi.org\/10.1007\/s00454-013-9561-6","journal-title":"Discret. Comput. Geom."},{"doi-asserted-by":"publisher","unstructured":"Santoyo, F., Ch\u00e1vez, E., Tellez, E.S.: A compressed index for hamming distances. In: Similarity Search and Applications, SISAP, pp. 113\u2013126 (2014). https:\/\/doi.org\/10.1007\/978-3-319-11988-5_11","key":"4_CR14","DOI":"10.1007\/978-3-319-11988-5_11"},{"doi-asserted-by":"publisher","unstructured":"Schneider, R., Weil, W.: Stochastic and integral geometry (2008). https:\/\/doi.org\/10.1007\/978-3-540-78859-1","key":"4_CR15","DOI":"10.1007\/978-3-540-78859-1"},{"unstructured":"Schuhmann, C., et al.: LAION-5B: an open large-scale dataset for training next generation image-text models. In: NeurIPS (2022)","key":"4_CR16"},{"issue":"3","key":"4_CR17","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1145\/1166074.1166077","volume":"31","author":"U Shaft","year":"2006","unstructured":"Shaft, U., Ramakrishnan, R.: Theory of nearest neighbors indexability. ACM Trans. Database Syst. 31(3), 814\u2013838 (2006). https:\/\/doi.org\/10.1145\/1166074.1166077","journal-title":"ACM Trans. Database Syst."},{"issue":"22","key":"4_CR18","first-page":"1409","volume":"38","author":"RR Sokal","year":"1958","unstructured":"Sokal, R.R., Michener, C.D.: A statiscal method for evaluating systematic relationships. Univ. Kansas Sci. Bull. 38(22), 1409\u20131438 (1958)","journal-title":"Univ. Kansas Sci. Bull."},{"doi-asserted-by":"publisher","unstructured":"Tellez, E.S., Aum\u00fcller, M., Chavez, E.: Overview of the SISAP 2023 indexing challenges. In: Pedreira, O., Estivill-Castro, V. (eds.) SISAP 2023, LNCS, vol. 14289, pp. 255\u2013264. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-46994-7_21","key":"4_CR19","DOI":"10.1007\/978-3-031-46994-7_21"},{"doi-asserted-by":"publisher","unstructured":"Thordsen, E., Schubert, E.: ABID: angle based intrinsic dimensionality. In: Similarity Search and Applications, SISAP, pp. 218\u2013232 (2020). https:\/\/doi.org\/10.1007\/978-3-030-60936-8_17","key":"4_CR20","DOI":"10.1007\/978-3-030-60936-8_17"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"101989","DOI":"10.1016\/j.is.2022.101989","volume":"108","author":"E Thordsen","year":"2022","unstructured":"Thordsen, E., Schubert, E.: ABID: angle based intrinsic dimensionality - theory and analysis. Inf. Syst. 108, 101989 (2022). https:\/\/doi.org\/10.1016\/j.is.2022.101989","journal-title":"Inf. Syst."}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-46994-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T07:02:33Z","timestamp":1698303753000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46994-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031469930","9783031469947"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46994-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Coruna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.sisap.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Familiarity, LaTeX and LNCS friendly, steering committee has subscription","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}