{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:27:45Z","timestamp":1740122865289,"version":"3.37.3"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"16","license":[{"start":{"date-parts":[[2022,3,18]],"date-time":"2022-03-18T00:00:00Z","timestamp":1647561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,18]],"date-time":"2022-03-18T00:00:00Z","timestamp":1647561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["307560\/2016-3"],"award-info":[{"award-number":["307560\/2016-3"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["400487\/2016-0"],"award-info":[{"award-number":["400487\/2016-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["425340\/2016-3"],"award-info":[{"award-number":["425340\/2016-3"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["304380\/2018-0"],"award-info":[{"award-number":["304380\/2018-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["422593\/2018-4"],"award-info":[{"award-number":["422593\/2018-4"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["88881.145912\/2017-01"],"award-info":[{"award-number":["88881.145912\/2017-01"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2014\/12236-1"],"award-info":[{"award-number":["2014\/12236-1"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2015\/24494-8"],"award-info":[{"award-number":["2015\/24494-8"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2016\/50250-1"],"award-info":[{"award-number":["2016\/50250-1"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2017\/20945-0"],"award-info":[{"award-number":["2017\/20945-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2015\/11937-9"],"award-info":[{"award-number":["2015\/11937-9"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2017\/12646-3"],"award-info":[{"award-number":["2017\/12646-3"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2017\/16246-0"],"award-info":[{"award-number":["2017\/16246-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/50155-0"],"award-info":[{"award-number":["2013\/50155-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/50169-1"],"award-info":[{"award-number":["2013\/50169-1"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2014\/ 50715-9"],"award-info":[{"award-number":["2014\/ 50715-9"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s11042-022-12248-w","type":"journal-article","created":{"date-parts":[[2022,3,18]],"date-time":"2022-03-18T07:02:47Z","timestamp":1647586967000},"page":"23449-23472","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A genetic programming approach for searching on nearest neighbors graphs"],"prefix":"10.1007","volume":"81","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5809-4228","authenticated-orcid":false,"given":"Javier A. Vargas","family":"Mu\u00f1oz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3333-6822","authenticated-orcid":false,"given":"Zanoni","family":"Dias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9772-263X","authenticated-orcid":false,"given":"Ricardo da Silva","family":"Torres","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,18]]},"reference":[{"key":"12248_CR1","unstructured":"Albarrac\u00edn J.F.H., Ferreira E., dos Santos J.A., da Silva Torres R (2017) Fusion of genetic-programming-based indices in hyperspectral image classification tasks. In: Proceeding of the IEEE international geoscience and remote sensing symposium, pp. 554\u2013557"},{"issue":"4","key":"12248_CR2","doi-asserted-by":"publisher","first-page":"2267","DOI":"10.3390\/rs12142267","volume":"12","author":"JFH Albarrac\u00edn","year":"2020","unstructured":"Albarrac\u00edn J.F.H., Oliveira R., Hirota M., dos Santos J.A., da Silva Torres R (2020) A soft computing approach for selecting and combining spectral bands. Remote Sens 12(4):2267\u20130000. https:\/\/www.mdpi.com\/769804","journal-title":"Remote Sens"},{"issue":"1","key":"12248_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A Andoni","year":"2008","unstructured":"Andoni A., Indyk P. (2008) Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun ACM 51(1):117\u2013122","journal-title":"Commun ACM"},{"key":"12248_CR4","doi-asserted-by":"crossref","unstructured":"Andr\u00e9 F., Kermarrec A.M., Le Scouarnec N. (2017) Accelerated nearest neighbor search with quick adc. In: Proceedings of the 2017 ACM on International Conference on Multimedia Retrieval, ICMR\u20192017, pp. 159\u2013166, ACM, New York, NY, USA","DOI":"10.1145\/3078971.3078992"},{"key":"12248_CR5","doi-asserted-by":"crossref","unstructured":"Aum\u00fcller M., Bernhardsson E., Faithfull A. Beecks C., Borutta F., Kr\u00f6ger P., Seidl T. (eds) (2017) Ann-benchmarks: a benchmarking tool for approximate nearest neighbor algorithms. Springer International Publishing, Cham","DOI":"10.1007\/978-3-319-68474-1_3"},{"key":"12248_CR6","doi-asserted-by":"crossref","unstructured":"Babenko A., Lempitsky V. (2014) Additive quantization for extreme vector compression. In: Proceedings of the Conference on Computer Vision and Pattern Recognition, pp. 931\u2013938","DOI":"10.1109\/CVPR.2014.124"},{"issue":"6","key":"12248_CR7","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1109\/TPAMI.2014.2361319","volume":"37","author":"A Babenko","year":"2015","unstructured":"Babenko A., Lempitsky V. (2015) The inverted multi-index. IEEE Trans Pattern Anal Mach Intell 37(6):1247\u20131260","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"12248_CR8","doi-asserted-by":"crossref","unstructured":"Bawa M., Condie T., Ganesan P. (2005) LSH forest: Self-tuning indexes for similarity search. In: Proceedings of the 14th International Conference on World Wide Web, WWW\u20192005, pp. 651\u2013660","DOI":"10.1145\/1060745.1060840"},{"issue":"9","key":"12248_CR9","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley J.L. (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18(9):509\u2013517","journal-title":"Commun ACM"},{"issue":"3","key":"12248_CR10","doi-asserted-by":"publisher","first-page":"2877","DOI":"10.1007\/s11042-018-6059-5","volume":"78","author":"CY Chiu","year":"2019","unstructured":"Chiu C.Y., Chiu J.S., Markchit S., Chou S.H. (2019) Effective product quantization-based indexing for nearest neighbor search. Multimed Tools Appl 78(3):2877\u20132895","journal-title":"Multimed Tools Appl"},{"issue":"1","key":"12248_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1080\/00018730601170527","volume":"56","author":"LdF Costa","year":"2007","unstructured":"Costa L.d.F., Rodrigues F.A., Travieso G., Villas Boas P.R. (2007) Characterization of complex networks: a survey of measurements. Adv Phys 56(1):167\u2013242","journal-title":"Adv Phys"},{"key":"12248_CR12","doi-asserted-by":"crossref","unstructured":"Dasgupta S., Freund Y. (2008) Random projection trees and low dimensional manifolds. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, STOC\u20192008, pp. 537\u2013546","DOI":"10.1145\/1374376.1374452"},{"issue":"2","key":"12248_CR13","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.patcog.2008.04.010","volume":"42","author":"S da","year":"2009","unstructured":"da S., Torres R., Falc\u00e3o A.X., Gon\u010balves M. A., Papa J.P., Zhang B., Fan W., Fox E.A. (2009) A genetic programming framework for content-based image retrieval. Pattern Recogn 42(2):283\u2013292","journal-title":"Pattern Recogn"},{"issue":"3","key":"12248_CR14","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/TKDE.2010.234","volume":"24","author":"MG de Carvalho","year":"2012","unstructured":"de Carvalho M.G., Laender A.H.F., Gon\u010balves M.A., da Silva A.S. (2012) A genetic programming approach to record deduplication. IEEE Trans Knowl Data Eng 24(3):399\u2013412","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"12248_CR15","doi-asserted-by":"crossref","unstructured":"Dong W., Moses C., Li K. (2011) Efficient k-nearest neighbor graph construction for generic similarity measures. In: Proceedings of the 20th International Conference on World Wide Web, WWW\u20192011, pp. 577\u2013586","DOI":"10.1145\/1963405.1963487"},{"issue":"3","key":"12248_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2934675","volume":"2","author":"C Efstathiades","year":"2016","unstructured":"Efstathiades C., Efentakis A., Pfoser D. (2016) Efficient processing of relevant nearest-neighbor queries. ACM Trans Spat Algorithms Syst 2(3):1\u201328","journal-title":"ACM Trans Spat Algorithms Syst"},{"key":"12248_CR17","doi-asserted-by":"crossref","unstructured":"Ge T., He K., Ke Q., Sun J. (2013) Optimized product quantization for approximate nearest neighbor search. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2946\u20132953","DOI":"10.1109\/CVPR.2013.379"},{"key":"12248_CR18","unstructured":"Goldberg A.V., Harrelson C. (2005) Computing the shortest path: A* search meets graph theory SODA\u20192005"},{"key":"12248_CR19","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.future.2018.04.094","volume":"87","author":"J Gonzalez-Lopez","year":"2018","unstructured":"Gonzalez-Lopez J., Ventura S., Cano A. (2018) Distributed nearest neighbor classification for large-scale multi-label data on spark. Futur Gener Comput Syst 87:66\u201382","journal-title":"Futur Gener Comput Syst"},{"key":"12248_CR20","doi-asserted-by":"crossref","unstructured":"Gubichev A., Bedathur S., Seufert S., Weikum G. (2010) Fast and accurate estimation of shortest paths in large graphs","DOI":"10.1145\/1871437.1871503"},{"key":"12248_CR21","doi-asserted-by":"crossref","unstructured":"Guttman A. (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, SIGMOD\u20191984, pp. 47\u201357, ACM, New York, NY, USA","DOI":"10.1145\/971697.602266"},{"key":"12248_CR22","doi-asserted-by":"crossref","unstructured":"Harwood B. (2016) Drummond, T.: FANNG: Fast approximate nearest neighbour graphs. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 5713\u20135722","DOI":"10.1109\/CVPR.2016.616"},{"key":"12248_CR23","doi-asserted-by":"crossref","unstructured":"Houle M.E., Ma X., Oria V., Sun J. (2014) Improving the quality of k-nn graphs for image databases through vector sparsification. In: Proceedings of International Conference on Multimedia Retrieval, ICMR\u20192014, pp. 89:89\u201389:96. ACM","DOI":"10.1145\/2578726.2578730"},{"key":"12248_CR24","doi-asserted-by":"crossref","unstructured":"Indyk P., Motwani R. (1998) Approximate nearest neighbors: Towards removing the curse of dimensionality. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 604\u2013613","DOI":"10.1145\/276698.276876"},{"key":"12248_CR25","volume-title":"Pruned bi-directed k-nearest neighbor graph for proximity search","author":"M Iwasaki","year":"2016","unstructured":"Iwasaki M. (2016) Pruned bi-directed k-nearest neighbor graph for proximity search. Springer International Publishing, Cham"},{"key":"12248_CR26","first-page":"333","volume":"3","author":"K Jebari","year":"2013","unstructured":"Jebari K. (2013) Selection methods for genetic algorithms. Int J Emerg Sci 3:333\u2013344","journal-title":"Int J Emerg Sci"},{"issue":"1","key":"12248_CR27","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H Jegou","year":"2011","unstructured":"Jegou H., Douze M., Schmid C. (2011) Product quantization for nearest neighbor search. IEEE Trans Pattern Anal Mach Intell 33(1):117\u2013128","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"12248_CR28","doi-asserted-by":"crossref","unstructured":"Ji T., Liu X., Deng C., Huang L., Lang B. (2014) Query-adaptive hash code ranking for fast nearest neighbor search. In: Proceedings of the 22nd ACM International Conference on Multimedia, MM\u20192014, pp. 1005\u20131008, ACM, New York, NY, USA","DOI":"10.1145\/2647868.2655018"},{"key":"12248_CR29","doi-asserted-by":"crossref","unstructured":"Kalantidis Y., Avrithis Y. (2014) Locally optimized product quantization for approximate nearest neighbor search. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2329\u20132336","DOI":"10.1109\/CVPR.2014.298"},{"key":"12248_CR30","volume-title":"Genetic Programming: on the programming of computers by means of natural selection, vol 1","author":"JR Koza","year":"1992","unstructured":"Koza J.R. (1992) Genetic Programming: on the programming of computers by means of natural selection, vol 1. MIT press, Cambridge"},{"key":"12248_CR31","doi-asserted-by":"crossref","unstructured":"Lacerda A., Cristo M., Gon\u00e7alves M.A., Fan W., Ziviani N., Ribeiro-Neto B. (2006) Learning to advertise. In: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR\u20192006, pp. 549\u2013556, ACM, New York, NY, USA","DOI":"10.1145\/1148170.1148265"},{"issue":"22","key":"12248_CR32","doi-asserted-by":"publisher","first-page":"23273","DOI":"10.1007\/s11042-016-4023-9","volume":"76","author":"J Li","year":"2017","unstructured":"Li J., Lan X., Wang J., Yang M., Zheng N. (2017) Fast additive quantization for vector compression in nearest neighbor search. Multimed Tools Appl 76(22):23273\u201323289","journal-title":"Multimed Tools Appl"},{"issue":"2","key":"12248_CR33","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.patcog.2008.04.012","volume":"42","author":"J Liu","year":"2009","unstructured":"Liu J., Li M., Liu Q., Lu H., Ma S. (2009) Image annotation via graph learning. Pattern Recogn 42(2):218\u2013228","journal-title":"Pattern Recogn"},{"key":"12248_CR34","doi-asserted-by":"crossref","unstructured":"Lowe D.G. (1999) Object recognition from local scale-invariant features. In: Proceedings of the Seventh IEEE International Conference on Computer Vision, vol. 2, pp. 1150\u20131157 vol.2.","DOI":"10.1109\/ICCV.1999.790410"},{"key":"12248_CR35","unstructured":"Lv Q., Josephson W., Wang Z., Charikar M., Li K. (2007) Multi-probe LSH: Efficient indexing for high-dimensional similarity search. In: Proceedings of the 33rd International Conference on Very Large Data Bases, VLDB\u20192007, pp. 950\u2013961"},{"key":"12248_CR36","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.is.2013.10.006","volume":"45","author":"YA Malkov","year":"2014","unstructured":"Malkov Y.A., Ponomarenko A., Logvinov A., Krylov V. (2014) Approximate nearest neighbor algorithm based on navigable small world graphs. Inf Syst 45:61\u201368","journal-title":"Inf Syst"},{"key":"12248_CR37","unstructured":"Malkov Y.A., Yashunin D.A. (2016)"},{"key":"12248_CR38","unstructured":"Muja M., Lowe D.G. (2009) Fast approximate nearest neighbors with automatic algorithm configuration. In: Proceedings of the International Conference on Computer Vision Theory and Application, pp. 331\u2013340"},{"issue":"11","key":"12248_CR39","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. (2014) Scalable nearest neighbor algorithms for high dimensional data. IEEE Trans Pattern Anal Mach Intell 36(11):2227\u20132240","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"12248_CR40","doi-asserted-by":"crossref","unstructured":"Papadias D. (2000) Hill climbing algorithms for content-based retrieval of similar configurations. In: Proceedings of the 23rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR\u20192000, pp. 240\u2013247, ACM, New York, NY, USA","DOI":"10.1145\/345508.345587"},{"key":"12248_CR41","doi-asserted-by":"crossref","unstructured":"Pennington J., Socher R., Manning C. (2014) Glove: Global vectors for word representation. In: Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing, pp. 1532\u20131543","DOI":"10.3115\/v1\/D14-1162"},{"key":"12248_CR42","doi-asserted-by":"crossref","unstructured":"Popescu A., Spyromitros-Xioufis E., Papadopoulos S., Le Borgne H., Kompatsiaris I. (2015) Toward an automatic evaluation of retrieval performance with large scale image collections. In: Proceedings of the 2015 Workshop on Community-Organized Multimodal Mining: Opportunities for Novel Solutions, MMCommons\u20192015, pp. 7\u201312, ACM, New York, NY, USA","DOI":"10.1145\/2814815.2814819"},{"key":"12248_CR43","doi-asserted-by":"crossref","unstructured":"Potamias M., Bonchi F., Castillo C., Gionis A. (2009) Fast shortest path distance estimation in large networks. In: Proceedings of the 18th ACM conference on Information and knowledge management, CIKM\u20192009, pp. 867\u2013876","DOI":"10.1145\/1645953.1646063"},{"key":"12248_CR44","doi-asserted-by":"crossref","unstructured":"Silpa-Anan C., Hartley R. (2008) Optimised kd-trees for fast image descriptor matching. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1\u20138","DOI":"10.1109\/CVPR.2008.4587638"},{"issue":"1-6","key":"12248_CR45","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/BF01759061","volume":"6","author":"RF Sproull","year":"1991","unstructured":"Sproull R.F. (1991) Refinements to nearest-neighbor searching in k-dimensional trees. Algorithmica 6(1-6):579\u2013589","journal-title":"Algorithmica"},{"key":"12248_CR46","doi-asserted-by":"crossref","unstructured":"Su F., Xue L. (2015) Graph learning on k nearest neighbours for automatic image annotation. In: Proceedings of the 5th ACM on International Conference on Multimedia Retrieval, ICMR\u20192015, pp. 403\u2013410, ACM, New York, NY, USA","DOI":"10.1145\/2671188.2749383"},{"issue":"2","key":"12248_CR47","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/1899412.1899418","volume":"2","author":"J Tang","year":"2011","unstructured":"Tang J., Hong R., Yan S., Chua T.S., Qi G.J., Jain R. (2011) Image annotation by knn-sparse graph-based label propagation over noisily tagged web images. ACM Trans Intell Syst Technol 2(2):14:1\u20131415","journal-title":"ACM Trans Intell Syst Technol"},{"key":"12248_CR48","doi-asserted-by":"crossref","unstructured":"Tretyakov K., Armas-Cervantes A., Garc\u00eda-ba\u00f1uelos L., Vilo J., Dumas M. (2011) Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs. In: Proceedings of the 20th ACM International Conference on Information and Knowledge Management, CIKM\u20192011, pp. 1785\u20131794, Association for Computing Machinery, New York, NY, USA","DOI":"10.1145\/2063576.2063834"},{"key":"12248_CR49","unstructured":"Vargas J.A. (2020) Large-scale indexing of high dimensional data via nearest neighbors graphs. Ph.D. thesis, University of Campinas, S\u00e3o Paulo, Brazil"},{"key":"12248_CR50","doi-asserted-by":"crossref","unstructured":"Vargas J.A., Dias Z., da S., Torres R. (2019) A genetic programming approach for searching on nearest neighbors graphs. In: Proceedings of the 2019 on International Conference on Multimedia Retrieval, ICMR \u201919, pp. 43\u201347, ACM, New York, NY, USA","DOI":"10.1145\/3323873.3325014"},{"key":"12248_CR51","first-page":"96","volume":"106970","author":"JA Vargas","year":"2019","unstructured":"Vargas J.A., Gon\u00e7alves M.A., Dias Z., da S., Torres R. (2019) Hierarchical clustering-based graphs for large scale approximate nearest neighbor search. Pattern Recogn 106970:96","journal-title":"Pattern Recogn"},{"key":"12248_CR52","doi-asserted-by":"crossref","unstructured":"Wang M., Zhou W., Tian Q., Pu J., Li H. (2017) Deep supervised quantization by self-organizing map. In: Proceedings of the 25th ACM International Conference on Multimedia, MM\u20192017, pp. 1707\u20131715, ACM, New York, NY, USA","DOI":"10.1145\/3123266.3123415"},{"issue":"17","key":"12248_CR53","doi-asserted-by":"publisher","first-page":"24407","DOI":"10.1007\/s11042-018-6987-0","volume":"78","author":"F Xiaokang","year":"2019","unstructured":"Xiaokang F., Jiangtao C., Hui L., Yingfan L. (2019) An efficient lsh indexing on discriminative short codes for high-dimensional nearest neighbors. Multimed Tools Appl 78(17):24407\u201324429","journal-title":"Multimed Tools Appl"},{"key":"12248_CR54","unstructured":"Yianilos P.N. (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, pp. 311\u2013321"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-022-12248-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-022-12248-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-022-12248-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T14:34:33Z","timestamp":1726842873000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-022-12248-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,18]]},"references-count":54,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["12248"],"URL":"https:\/\/doi.org\/10.1007\/s11042-022-12248-w","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"type":"print","value":"1380-7501"},{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2022,3,18]]},"assertion":[{"value":"9 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}