{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:30:13Z","timestamp":1742913013721,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030483241"},{"type":"electronic","value":"9783030483258"}],"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-48325-8_16","type":"book-chapter","created":{"date-parts":[[2020,5,13]],"date-time":"2020-05-13T08:02:45Z","timestamp":1589356965000},"page":"234-249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Heuristics for Computing k-Nearest Neighbors Graphs"],"prefix":"10.1007","author":[{"given":"Edgar","family":"Ch\u00e1vez","sequence":"first","affiliation":[]},{"given":"Ver\u00f3nica","family":"Ludue\u00f1a","sequence":"additional","affiliation":[]},{"given":"Nora","family":"Reyes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,14]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1007\/11566489_106","volume-title":"Medical Image Computing and Computer-Assisted Intervention \u2013 MICCAI 2005","author":"N Archip","year":"2005","unstructured":"Archip, N., Rohling, R., Cooperberg, P., Tahmasebpour, H., Warfield, S.K.: Spectral clustering algorithms for ultrasound image segmentation. In: Duncan, J.S., Gerig, G. (eds.) MICCAI 2005. LNCS, vol. 3750, pp. 862\u2013869. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11566489_106"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-540-24681-7_19","volume-title":"Advances in Web Intelligence","author":"R Baeza-Yates","year":"2004","unstructured":"Baeza-Yates, R., Hurtado, C., Mendoza, M.: Query clustering for boosting web page ranking. In: Favela, J., Menasalvas, E., Ch\u00e1vez, E. (eds.) AWIC 2004. LNCS (LNAI), vol. 3034, pp. 164\u2013175. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-24681-7_19"},{"issue":"4","key":"16_CR3","first-page":"33","volume":"35","author":"M Brito","year":"1996","unstructured":"Brito, M., Ch\u00e1vez, E., Quiroz, A., Yukich, J.: Connectivity of the mutual k-nearest neighbor graph in clustering and outlier detection. Stat. Probab. Lett. 35(4), 33\u201342 (1996)","journal-title":"Stat. Probab. Lett."},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"P Callahan","year":"1995","unstructured":"Callahan, P., Kosaraju, R.: A decomposition of multidimensional point sets with applications to k nearest neighbors and n body potential fields. JACM 42(1), 67\u201390 (1995)","journal-title":"JACM"},{"key":"16_CR5","unstructured":"Ch\u00e1vez, E., Ludue\u00f1a, V., Reyes, N.: Solving all-k-nearest neighbor problem without an index. In: Procs. del XXV Congreso Argentino de Ciencias de la Computaci\u00f3n (CACIC 2019), pp. 567\u2013576. UniR\u00edo editora (2019)"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.is.2015.10.014","volume":"59","author":"E Ch\u00e1vez","year":"2016","unstructured":"Ch\u00e1vez, E., Ludue\u00f1a, V., Reyes, N., Roggero, P.: Faster proximity searching with the distal sat. Inf. Syst. 59, 15\u201347 (2016)","journal-title":"Inf. Syst."},{"issue":"9","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1016\/j.patrec.2004.11.014","volume":"26","author":"E Ch\u00e1vez","year":"2005","unstructured":"Ch\u00e1vez, E., Navarro, G.: A compact space decomposition for effective metric indexing. Pattern Recogn. Lett. 26(9), 1363\u20131376 (2005)","journal-title":"Pattern Recogn. Lett."},{"issue":"3","key":"16_CR8","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroqu\u00edn, J.: Searching in metric spaces. ACM Comput. Surv. 33(3), 273\u2013321 (2001)","journal-title":"ACM Comput. Surv."},{"key":"16_CR9","volume-title":"Pattern Classification and Scene Analysis","author":"R Duda","year":"1973","unstructured":"Duda, R., Hart, P.: Pattern Classification and Scene Analysis. Wiley, New York (1973)"},{"key":"16_CR10","first-page":"321","volume":"11\u20133","author":"D Eppstein","year":"1994","unstructured":"Eppstein, D., Erickson, J.: Iterated nearest neighbors and finding minimal polytopes. Int. J. Math. Comput. Sci. 11\u20133, 321\u2013350 (1994)","journal-title":"Int. J. Math. Comput. Sci."},{"key":"16_CR11","unstructured":"Figueroa, K., Navarro, G., Ch\u00e1vez, E.: Metric spaces library (2007). \nhttp:\/\/www.sisap.org\/Metric_Space_Library.html"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.is.2016.06.004","volume":"64","author":"G Navarro","year":"2017","unstructured":"Navarro, G., Paredes, R., Reyes, N., Bustos, C.: An empirical evaluation of intrinsic dimension estimators. Inf. Syst. 64, 206\u2013218 (2017)","journal-title":"Inf. Syst."},{"key":"16_CR13","unstructured":"Paredes, R.: Graphs for Metric Space Searching. Ph.D. thesis, University of Chile, Chile, July 2008"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/11764298_8","volume-title":"Experimental Algorithms","author":"R Paredes","year":"2006","unstructured":"Paredes, R., Ch\u00e1vez, E., Figueroa, K., Navarro, G.: Practical construction of k-nearest neighbor graphs in metric spaces. In: \u00c0lvarez, C., Serna, M. (eds.) WEA 2006. LNCS, vol. 4007, pp. 85\u201397. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11764298_8"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Rubinstein, A.: Hardness of approximate nearest neighbor search. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1260\u20131268. ACM (2018)","DOI":"10.1145\/3188745.3188916"}],"container-title":["Communications in Computer and Information Science","Computer Science \u2013 CACIC 2019"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48325-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,13]],"date-time":"2020-05-13T08:06:25Z","timestamp":1589357185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-48325-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030483241","9783030483258"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48325-8_16","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CACIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentine Congress of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"R\u00edo Cuarto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cacic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cacic2019.exa.unrc.edu.ar\/","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":"RedUNCI","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","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":"27","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":"15% - 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.1","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.05","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)"}}]}}