{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T17:28:47Z","timestamp":1745429327189,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"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_23","type":"book-chapter","created":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T07:02:16Z","timestamp":1698303736000},"page":"273-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["General and\u00a0Practical Tuning Method for\u00a0Off-the-Shelf Graph-Based Index: SISAP Indexing Challenge Report by\u00a0Team UTokyo"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-9384-2994","authenticated-orcid":false,"given":"Yutaro","family":"Oguri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1529-0154","authenticated-orcid":false,"given":"Yusuke","family":"Matsui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,27]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Akiba, T., Sano, S., Yanase, T., Ohta, T., Koyama, M.: Optuna: a next-generation hyperparameter optimization framework. In: Proceedings SIGKDD (2019)","DOI":"10.1145\/3292500.3330701"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-030-86475-0_22","volume-title":"Database and Expert Systems Applications","author":"Y Arai","year":"2021","unstructured":"Arai, Y., Amagata, D., Fujita, S., Hara, T.: LGTM: a fast and accurate kNN search algorithm in high-dimensional spaces. In: Strauss, C., Kotsis, G., Tjoa, A.M., Khalil, I. (eds.) DEXA 2021. LNCS, vol. 12924, pp. 220\u2013231. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86475-0_22"},{"key":"23_CR3","unstructured":"Bergstra, J., Bardenet, R., Bengio, Y., K\u00e9gl, B.: Algorithms for hyper-parameter optimization. In: Proceedings NIPS2021, pp. 2546\u20132554. Curran Associates Inc. (2011)"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"461","DOI":"10.14778\/3303753.3303754","volume":"12","author":"C Fu","year":"2017","unstructured":"Fu, C., Xiang, C., Wang, C., Cai, D.: Fast approximate nearest neighbor search with the navigating spreading-out graph. Proc. VLDB Endow. 12, 461\u2013474 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"23_CR5","unstructured":"Iwasaki, M., Miyazaki, D.: Optimization of indexing based on k-nearest neighbor graph for proximity search in high-dimensional data. preprint: arXiv:1810.07355 (2018)"},{"issue":"3","key":"23_CR6","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)","journal-title":"IEEE Trans. Big Data"},{"issue":"1","key":"23_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H J\u00e8gou","year":"2011","unstructured":"J\u00e8gou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. IEEE Trans. PatternAnal. Mach. Intell. 33(1), 117\u2013128 (2011)","journal-title":"IEEE Trans. PatternAnal. Mach. Intell."},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TPAMI.2018.2889473","volume":"42","author":"YA Malkov","year":"2016","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, 824\u2013836 (2016)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"23_CR9","unstructured":"Matsui, Y., Aum\u00fcller, M., Xiao, H.: CVPR 2023 tutorial on neural search in action (2023)"},{"key":"23_CR10","unstructured":"Schuhmann, C., et al.: LAION-5b: an open large-scale dataset for training next generation image-text models. In: NeurIPS 2022 Datasets and Benchmarks Track (2022)"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Tanaka, K., Matsui, Y., Satoh, S.: Efficient nearest neighbor search by removing anti-hub. In: Proceedings ICMR2021, pp. 285\u2013293. ACM (2021)","DOI":"10.1145\/3460426.3463622"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Tellez, E.S., Aum\u00fcller, M., Chavez, E.: Overview of the SISAP 2023 indexing challenges. In: Similarity Search and Applications: 16th International Conference, SISAP 2023, A Coru\u00f1a Spain, 9\u201311 October, Proceedings. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-46994-7_21"},{"key":"23_CR13","unstructured":"Tellez, E.S., Ruiz, G.: Similarity search on neighbor\u2019s graphs with automatic pareto optimal performance and minimum expected quality setups based on hyperparameter optimization (2022)"},{"issue":"75","key":"23_CR14","doi-asserted-by":"publisher","first-page":"4442","DOI":"10.21105\/joss.04442","volume":"7","author":"ES Tellez","year":"2022","unstructured":"Tellez, E.S., Ruiz, G.: SimilaritySearch.jl autotuned nearest neighbor indexes for Julia. J. Open Source Softw. 7(75), 4442 (2022)","journal-title":"J. Open Source Softw."}],"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_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,24]],"date-time":"2023-12-24T19:31:12Z","timestamp":1703446272000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46994-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031469930","9783031469947"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46994-7_23","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)"}}]}}