{"id":"https://openalex.org/W2950725338","doi":"https://doi.org/10.1145/3323873.3325014","title":"A Genetic Programming Approach for Searching on Nearest Neighbors Graphs","display_name":"A Genetic Programming Approach for Searching on Nearest Neighbors Graphs","publication_year":2019,"publication_date":"2019-06-05","ids":{"openalex":"https://openalex.org/W2950725338","doi":"https://doi.org/10.1145/3323873.3325014","mag":"2950725338"},"language":"en","primary_location":{"id":"doi:10.1145/3323873.3325014","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3323873.3325014","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 on International Conference on Multimedia Retrieval","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hdl.handle.net/11250/3055863","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068674805","display_name":"Javier A. V. Mu\u00f1oz","orcid":"https://orcid.org/0000-0002-5809-4228"},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"education","lineage":["https://openalex.org/I181391015"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Javier A. Vargas Mu\u00f1oz","raw_affiliation_strings":["Institute of Computing Campinas, Campinas, Brazil"],"affiliations":[{"raw_affiliation_string":"Institute of Computing Campinas, Campinas, Brazil","institution_ids":["https://openalex.org/I181391015"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042140271","display_name":"Zanoni Dias","orcid":"https://orcid.org/0000-0003-3333-6822"},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"education","lineage":["https://openalex.org/I181391015"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Zanoni Dias","raw_affiliation_strings":["Institute of Computing Campinas, Campinas, Brazil"],"affiliations":[{"raw_affiliation_string":"Institute of Computing Campinas, Campinas, Brazil","institution_ids":["https://openalex.org/I181391015"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087058987","display_name":"Ricardo da Silva Torres","orcid":"https://orcid.org/0000-0001-9772-263X"},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"education","lineage":["https://openalex.org/I181391015"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Ricardo da S. Torres","raw_affiliation_strings":["Institute of Computing Campinas, Campinas, Brazil"],"affiliations":[{"raw_affiliation_string":"Institute of Computing Campinas, Campinas, Brazil","institution_ids":["https://openalex.org/I181391015"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5068674805"],"corresponding_institution_ids":["https://openalex.org/I181391015"],"apc_list":null,"apc_paid":null,"fwci":0.5108,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.68905073,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"43","last_page":"47"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9745000004768372,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12535","display_name":"Machine Learning and Data Classification","score":0.9628000259399414,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.7348797917366028},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6701366305351257},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6141375303268433},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5612283945083618},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.5348761081695557},{"id":"https://openalex.org/keywords/genetic-programming","display_name":"Genetic programming","score":0.5114290118217468},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.4662071168422699},{"id":"https://openalex.org/keywords/large-margin-nearest-neighbor","display_name":"Large margin nearest neighbor","score":0.4576732814311981},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44091564416885376},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.42888501286506653},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35602325201034546},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3256962299346924},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32251182198524475},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2893962264060974},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2726769745349884},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09553489089012146}],"concepts":[{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.7348797917366028},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6701366305351257},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6141375303268433},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5612283945083618},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.5348761081695557},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.5114290118217468},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.4662071168422699},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.4576732814311981},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44091564416885376},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.42888501286506653},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35602325201034546},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3256962299346924},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32251182198524475},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2893962264060974},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2726769745349884},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09553489089012146}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3323873.3325014","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3323873.3325014","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 on International Conference on Multimedia Retrieval","raw_type":"proceedings-article"},{"id":"pmh:oai:ntnuopen.ntnu.no:11250/3055863","is_oa":true,"landing_page_url":"https://hdl.handle.net/11250/3055863","pdf_url":null,"source":{"id":"https://openalex.org/S4306401716","display_name":"Duo Research Archive (University of Oslo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I184942183","host_organization_name":"University of Oslo","host_organization_lineage":["https://openalex.org/I184942183"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"0","raw_type":"info:eu-repo/semantics/other"}],"best_oa_location":{"id":"pmh:oai:ntnuopen.ntnu.no:11250/3055863","is_oa":true,"landing_page_url":"https://hdl.handle.net/11250/3055863","pdf_url":null,"source":{"id":"https://openalex.org/S4306401716","display_name":"Duo Research Archive (University of Oslo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I184942183","host_organization_name":"University of Oslo","host_organization_lineage":["https://openalex.org/I184942183"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"0","raw_type":"info:eu-repo/semantics/other"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320997","display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","ror":"https://ror.org/02ddkpn78"},{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1576818901","https://openalex.org/W1965401349","https://openalex.org/W1969494827","https://openalex.org/W1984349431","https://openalex.org/W1987566020","https://openalex.org/W2029173860","https://openalex.org/W2038276547","https://openalex.org/W2086179657","https://openalex.org/W2090398718","https://openalex.org/W2099253838","https://openalex.org/W2106521941","https://openalex.org/W2110026675","https://openalex.org/W2111006384","https://openalex.org/W2118123209","https://openalex.org/W2118269922","https://openalex.org/W2124509324","https://openalex.org/W2133995768","https://openalex.org/W2147717514","https://openalex.org/W2148781362","https://openalex.org/W2165558283","https://openalex.org/W2171572695","https://openalex.org/W2250539671","https://openalex.org/W2274427513","https://openalex.org/W2318810549","https://openalex.org/W2427312773","https://openalex.org/W2607589993","https://openalex.org/W2609979645","https://openalex.org/W2757662681","https://openalex.org/W2765323189","https://openalex.org/W2774235497","https://openalex.org/W3101172773","https://openalex.org/W4289753431"],"related_works":["https://openalex.org/W2795392346","https://openalex.org/W4246757943","https://openalex.org/W2969538544","https://openalex.org/W2351157934","https://openalex.org/W1595303882","https://openalex.org/W2182477562","https://openalex.org/W2526367648","https://openalex.org/W2148008870","https://openalex.org/W2571415506","https://openalex.org/W2108882154"],"abstract_inverted_index":{"The":[0],"use":[1],"of":[2,59,62,118],"nearest":[3,20,100],"neighbors":[4],"graphs":[5,27,63],"has":[6],"been":[7],"leading":[8],"to":[9,39,49,73,90,96],"considerable":[10],"gains":[11,117],"over":[12,110,122],"classic":[13,124],"approaches":[14],"(e.g.,":[15],"tree-indexing-based":[16],"methods)":[17],"in":[18,30,83],"approximate":[19],"neighbor":[21,41],"searches.":[22],"Classical":[23],"searches":[24],"on":[25,127],"these":[26],"are":[28],"conduced":[29],"a":[31,69,75,111],"greedy":[32],"way":[33],"by":[34],"moving":[35],"at":[36],"each":[37],"step":[38],"the":[40,46,50,57,65,80,84,92,98,119,123],"(of":[42],"current":[43],"vertex)":[44],"with":[45,105],"lowest":[47],"distance":[48,66],"query.":[51],"In":[52],"this":[53],"work,":[54],"we":[55],"explore":[56],"combination":[58],"topological":[60],"properties":[61],"and":[64],"itself":[67],"through":[68],"Genetic":[70],"Programming":[71],"framework":[72],"obtain":[74],"better":[76],"indicator":[77],"for":[78],"selecting":[79],"next":[81],"vertex":[82],"search":[85,125],"process.":[86],"Our":[87],"objective":[88],"is":[89],"minimize":[91],"scan":[93],"rate":[94],"needed":[95],"reach":[97],"true":[99],"neighbors.":[101],"Experimental":[102],"results,":[103],"conducted":[104],"three":[106],"different":[107],"graph-based":[108],"methods":[109],"large":[112],"textual":[113],"collection,":[114],"show":[115],"significant":[116],"proposed":[120],"approach":[121],"algorithm":[126],"graphs.":[128]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}