{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:22:12Z","timestamp":1742923332749,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030648428"},{"type":"electronic","value":"9783030648435"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64843-5_2","type":"book-chapter","created":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T16:04:24Z","timestamp":1607097864000},"page":"19-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Sub-linear Time Algorithm for Approximating k-Nearest-Neighbor with Full Quality Guarantee"],"prefix":"10.1007","author":[{"given":"Hengzhao","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,4]]},"reference":[{"key":"2_CR1","unstructured":"Poisson Point Process. https:\/\/wikimili.com\/en\/Poisson_point_process"},{"issue":"3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1007\/s11042-012-1271-1","volume":"71","author":"G Amato","year":"2012","unstructured":"Amato, G., Gennaro, C., Savino, P.: MI-file: using inverted files for scalable approximate similarity search. Multimed. Tools Appl. 71(3), 1333\u20131362 (2012). https:\/\/doi.org\/10.1007\/s11042-012-1271-1","journal-title":"Multimed. Tools Appl."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Andoni, A., Laarhoven, T., Razenshteyn, I., Waingarten, E.: Optimal hashing-based time-space trade-offs for approximate near neighbors. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 47\u201366, January 2017","DOI":"10.1137\/1.9781611974782.4"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Andoni, A., Razenshteyn, I.: Optimal data-dependent hashing for approximate near neighbors. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing - STOC 2015, pp. 793\u2013801 (2015)","DOI":"10.1145\/2746539.2746553"},{"key":"2_CR5","unstructured":"B\u00e2doiu, M., B\u00e2doiu, M., Clarkson, K.L., Clarkson, K.L.: Smaller core-sets for balls. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 801\u2013802 (2003)"},{"issue":"9","key":"2_CR6","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"issue":"01","key":"2_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1142\/S0218195991000074","volume":"01","author":"M Bern","year":"1991","unstructured":"Bern, M., Eppstein, D., Yao, F.: The expected extremes in a delaunay triangulation. Int. J. Comput. Geom. Appl. 01(01), 79\u201391 (1991)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"2_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.comgeo.2006.05.005","volume":"36","author":"P Bose","year":"2007","unstructured":"Bose, P., Devroye, L.: On the stabbing number of a random Delaunay triangulation. Comput. Geom.: Theory Appl. 36(2), 89\u2013105 (2007)","journal-title":"Comput. Geom.: Theory Appl."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Buchin, K., Mulzer, W.: Delaunay triangulations in O(sort(n)) time and more. In: Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS , vol. 5, pp. 139\u2013148 (2009)","DOI":"10.1109\/FOCS.2009.53"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"de Castro, P.M.M., Devillers, O.: Simple and efficient distribution-sensitive point location in triangulations. In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 127\u2013138, January 2011","DOI":"10.1137\/1.9781611972917.13"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the Twentieth Annual Symposium on Computational Geometry - SCG 2004, pp. 253\u2013262 (2004)","DOI":"10.1145\/997817.997857"},{"issue":"02","key":"2_CR12","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1142\/S0129054102001047","volume":"13","author":"O Devillers","year":"2002","unstructured":"Devillers, O., Pion, S., Teillaud, M.: Walking in a triangulation. Int. J. Found. Comput. Sci. 13(02), 181\u2013199 (2002)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"5","key":"2_CR13","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. Inf. Process. Manage. 48(5), 889\u2013902 (2012)","journal-title":"Inf. Process. Manage."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Gan, J., Feng, J., Fang, Q., Ng, W.: Locality-sensitive hashing scheme based on dynamic collision counting. In: Proceedings of the 2012 International Conference on Management of Data - SIGMOD 2012, pp. 541\u2013552 (2012)","DOI":"10.1145\/2213836.2213898"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Gao, J., Jagadish, H., Ooi, B.C., Wang, S.: Selective hashing: closing the gap between radius search and k-NN Search. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD 2015, pp. 349\u2013358 (2015)","DOI":"10.1145\/2783258.2783284"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: A replacement for Voronoi diagrams of near linear size. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 94\u2013103. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959884"},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"321","DOI":"10.4086\/toc.2012.v008a014","volume":"8","author":"S Har-Peled","year":"2012","unstructured":"Har-Peled, S., Indyk, P., Motwani, R.: Approximate nearest neighbor: towards removing the curse of dimensionality. Theory Comput. 8(1), 321\u2013350 (2012)","journal-title":"Theory Comput."},{"key":"2_CR18","unstructured":"Hengzhao Ma, J.L.: A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee (2020). https:\/\/arxiv.org\/abs\/2008.02924"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing - STOC 1998, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"2_CR20","unstructured":"Lin, P.C., Zhao, W.L.: Graph based Nearest Neighbor Search: Promises and Failures, pp. 1\u20138 (2019)"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Ma, H., Li, J.: An algorithm for reducing approximate nearest neighbor to approximate near neighbor with O(log n) query time. In: 12th International Conference on Combinatorial Optimization and Applications - COCOA 2018, pp. 465\u2013479 (2018)","DOI":"10.1007\/978-3-030-04651-4_31"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.is.2013.10.006","volume":"45","author":"Y Malkov","year":"2014","unstructured":"Malkov, Y., Ponomarenko, A., Logvinov, A., Krylov, V.: Approximate nearest neighbor algorithm based on navigable small world graphs. Inf. Syst. 45, 61\u201368 (2014)","journal-title":"Inf. Syst."},{"key":"2_CR23","unstructured":"Mitchell, J.S., Mulzer, W.: Proximity algorithms. In: Handbook of Discrete and Computational Geometry, Third Edition, pp. 849\u2013874 (2017)"},{"issue":"1\u20132","key":"2_CR24","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0925-7721(98)00035-2","volume":"12","author":"EP M\u00fccke","year":"1999","unstructured":"M\u00fccke, E.P., Saias, I., Zhu, B.: Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations. Comput. Geom. 12(1\u20132), 63\u201383 (1999)","journal-title":"Comput. Geom."},{"issue":"11","key":"2_CR25","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TPAMI.2014.2321376","volume":"36","author":"M Muja","year":"2014","unstructured":"Muja, M., Lowe, D.G.: Scalable nearest neighbor algorithms for high dimensional data. IEEE Trans. Pattern Anal. Mach. Intell. 36(11), 2227\u20132240 (2014)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2_CR26","unstructured":"Ocsa, A., Bedregal, C., Cuadros-vargas, E., Society, P.C.: A new approach for similarity queries using proximity graphs, pp. 131\u2013142. Simp\u00f3sio Brasileiro de Banco de Dados (2007)"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Paredes, R., Ch\u00e1vez, E.: Using the k-nearest neighbor graph for proximity searching in metric spaces. In: International Symposium on String Processing and Information Retrieval, pp. 127\u2013138 (2005)","DOI":"10.1007\/11575832_14"},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.14778\/2735461.2735462","volume":"8","author":"Y Sun","year":"2014","unstructured":"Sun, Y., Wang, W., Qin, J., Zhang, Y., Lin, X.: SRS: solving c-approximate nearest neighbor queries in high dimensional Euclidean space with a tiny index. Proc. VLDB Endow. 8, 1\u201312 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"2_CR29","unstructured":"Wang, J., Shen, H.T., Song, J., Ji, J.: Hashing for similarity search: a survey. In: ArXiv:1408.2927 (2014)"},{"key":"2_CR30","unstructured":"Weber, R., Schek, H.J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proceedings of 24rd International Conference on Very Large Data Bases, pp. 194\u2013205 (1998)"},{"key":"2_CR31","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, pp. 311\u2013321 (1993)"},{"issue":"3","key":"2_CR32","doi-asserted-by":"publisher","first-page":"1368","DOI":"10.1137\/070690419","volume":"19","author":"EA Yildirim","year":"2008","unstructured":"Yildirim, E.A.: Two algorithms for the minimum enclosing ball problem. SIAM J. Optim. 19(3), 1368\u20131391 (2008)","journal-title":"SIAM J. Optim."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64843-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T16:45:04Z","timestamp":1607100304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64843-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030648428","9783030648435"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64843-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2020\/","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":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"104","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":"55","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":"0","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":"53% - 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":"5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic this event was held virtually.","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)"}}]}}