{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:52:43Z","timestamp":1773481963150,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T00:00:00Z","timestamp":1559692800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","award":["2014\/12236-1, 2015\/24494-8, 2016\/50250-1, 2017\/20945-0, 2013\/50155-0, 2013\/50169-1, 2014\/50715-9"],"award-info":[{"award-number":["2014\/12236-1, 2015\/24494-8, 2016\/50250-1, 2017\/20945-0, 2013\/50155-0, 2013\/50169-1, 2014\/50715-9"]}]},{"name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","award":["307560\/2016-3"],"award-info":[{"award-number":["307560\/2016-3"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,5]]},"DOI":"10.1145\/3323873.3325014","type":"proceedings-article","created":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T12:10:58Z","timestamp":1560168658000},"page":"43-47","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["A Genetic Programming Approach for Searching on Nearest Neighbors Graphs"],"prefix":"10.1145","author":[{"given":"Javier A.","family":"Vargas Mu\u00f1oz","sequence":"first","affiliation":[{"name":"Institute of Computing Campinas, Campinas, Brazil"}]},{"given":"Zanoni","family":"Dias","sequence":"additional","affiliation":[{"name":"Institute of Computing Campinas, Campinas, Brazil"}]},{"given":"Ricardo","family":"da S. Torres","sequence":"additional","affiliation":[{"name":"Institute of Computing Campinas, Campinas, Brazil"}]}],"member":"320","published-online":{"date-parts":[[2019,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/IGARSS.2017.8127013"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3078971.3078992"},{"key":"e_1_3_2_1_4_1","volume-title":"ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms","author":"Aum\u00fcller Martin","unstructured":"Martin Aum\u00fcller , Erik Bernhardsson , and Alexander Faithfull . 2017. ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms . In Similarity Search and Applications, Christian Beecks, Felix Borutta, Peer Kr\u00f6ger, and Thomas Seidl (Eds.). Springer International Publishing , Cham , 34--49. Martin Aum\u00fcller, Erik Bernhardsson, and Alexander Faithfull. 2017. ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms. In Similarity Search and Applications, Christian Beecks, Felix Borutta, Peer Kr\u00f6ger, and Thomas Seidl (Eds.). Springer International Publishing, Cham, 34--49."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2361319"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060840"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_2_1_8_1","volume-title":"Characterization of complex networks: A survey of measurements. Advances in physics","author":"Costa Luciano","year":"2007","unstructured":"Luciano da F. Costa , Francisco A Rodrigues , Gonzalo Travieso , and Paulino Ribeiro Villas Boas . 2007. Characterization of complex networks: A survey of measurements. Advances in physics , Vol. 56 , 1 ( 2007 ), 167--242. Luciano da F. Costa, Francisco A Rodrigues, Gonzalo Travieso, and Paulino Ribeiro Villas Boas. 2007. Characterization of complex networks: A survey of measurements. Advances in physics, Vol. 56, 1 (2007), 167--242."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2008.04.010"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374452"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.234"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.379"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.616"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_17_1","volume-title":"Similarity Search and Applications","author":"Iwasaki Masajiro","unstructured":"Masajiro Iwasaki . 2016. Pruned Bi-directed K-nearest Neighbor Graph for Proximity Search . In Similarity Search and Applications . Springer International Publishing , Cham , 20--33. Masajiro Iwasaki. 2016. Pruned Bi-directed K-nearest Neighbor Graph for Proximity Search. In Similarity Search and Applications. Springer International Publishing, Cham, 20--33."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2647868.2655018"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.298"},{"key":"e_1_3_2_1_21_1","volume-title":"Genetic Programming: on the programming of computers by means of natural selection","author":"Koza John R.","unstructured":"John R. Koza . 1992. Genetic Programming: on the programming of computers by means of natural selection . Vol. 1 . MIT press . John R. Koza. 1992. Genetic Programming: on the programming of computers by means of natural selection. Vol. 1. MIT press."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148265"},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of the 33rd International Conference on Very Large Data Bases (VLDB'2007)","author":"Lv Qin","year":"2007","unstructured":"Qin Lv , William Josephson , Zhe Wang , Moses Charikar , and Kai Li . 2007 . Multi-probe LSH: Efficient Indexing for High-dimensional Similarity Search . In Proceedings of the 33rd International Conference on Very Large Data Bases (VLDB'2007) . 950--961. Qin Lv, William Josephson, Zhe Wang, Moses Charikar, and Kai Li. 2007. Multi-probe LSH: Efficient Indexing for High-dimensional Similarity Search. In Proceedings of the 33rd International Conference on Very Large Data Bases (VLDB'2007). 950--961."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.006"},{"key":"e_1_3_2_1_25_1","unstructured":"Yury A. Malkov and D. A. Yashunin. 2016. Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs. arXiv preprint arXiv:1603.09320 (2016).  Yury A. Malkov and D. A. Yashunin. 2016. Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs. arXiv preprint arXiv:1603.09320 (2016)."},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the International Conference on Computer Vision Theory and Application. 331--340","author":"Muja Marius","unstructured":"Marius Muja and David G. Lowe . 2009. Fast Approximate Nearest Neighbors with Automatic Algorithm Configuration . In Proceedings of the International Conference on Computer Vision Theory and Application. 331--340 . Marius Muja and David G. Lowe. 2009. Fast Approximate Nearest Neighbors with Automatic Algorithm Configuration. In Proceedings of the International Conference on Computer Vision Theory and Application. 331--340."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345587"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01759061"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3123266.3123415"},{"key":"e_1_3_2_1_32_1","volume-title":"Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms. 311--321","author":"Yianilos Peter N.","year":"1993","unstructured":"Peter N. Yianilos . 1993 . Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces . In Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms. 311--321 . Peter N. Yianilos. 1993. Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces. In Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms. 311--321."}],"event":{"name":"ICMR '19: International Conference on Multimedia Retrieval","location":"Ottawa ON Canada","acronym":"ICMR '19","sponsor":["SIGMM ACM Special Interest Group on Multimedia"]},"container-title":["Proceedings of the 2019 on International Conference on Multimedia Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323873.3325014","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3323873.3325014","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:22Z","timestamp":1750208542000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323873.3325014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,5]]},"references-count":32,"alternative-id":["10.1145\/3323873.3325014","10.1145\/3323873"],"URL":"https:\/\/doi.org\/10.1145\/3323873.3325014","relation":{},"subject":[],"published":{"date-parts":[[2019,6,5]]},"assertion":[{"value":"2019-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}