{"id":"https://openalex.org/W2074531160","doi":"https://doi.org/10.1016/0167-8655(85)90036-4","title":"An improved branch and bound algorithm for computing k-nearest neighbors","display_name":"An improved branch and bound algorithm for computing k-nearest neighbors","publication_year":1985,"publication_date":"1985-01-01","ids":{"openalex":"https://openalex.org/W2074531160","doi":"https://doi.org/10.1016/0167-8655(85)90036-4","mag":"2074531160"},"language":"en","primary_location":{"id":"doi:10.1016/0167-8655(85)90036-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-8655(85)90036-4","pdf_url":null,"source":{"id":"https://openalex.org/S151820558","display_name":"Pattern Recognition Letters","issn_l":"0167-8655","issn":["0167-8655","1872-7344"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pattern Recognition Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029654352","display_name":"Behrooz Kamgar-Parsi","orcid":null},"institutions":[{"id":"https://openalex.org/I1299303238","display_name":"National Institutes of Health","ror":"https://ror.org/01cwqze88","country_code":"US","type":"government","lineage":["https://openalex.org/I1299022934","https://openalex.org/I1299303238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Behrooz Kamgar-Parsi","raw_affiliation_strings":["Laboratory of Applied Studies, Division of Computer Research and Technology, National Institutes of Health, Bethesda, MD 20205, USA","Laboratory of Applied Studies, Division of Computer Research and Technology, National Institutes of Health, Bethesda, MD 20205, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Laboratory of Applied Studies, Division of Computer Research and Technology, National Institutes of Health, Bethesda, MD 20205, USA","institution_ids":["https://openalex.org/I1299303238"]},{"raw_affiliation_string":"Laboratory of Applied Studies, Division of Computer Research and Technology, National Institutes of Health, Bethesda, MD 20205, USA#TAB#","institution_ids":["https://openalex.org/I1299303238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109918767","display_name":"Laveen N. Kanal","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Laveen N Kanal","raw_affiliation_strings":["Machine Intelligence and Pattern Analysis Lab, Department of Computer Science, University of Maryland, College Park, MD 20742, USA","Machine Intelligence and Pattern Analysis Lab., Dept. of Computer Science, University of Maryland, College Park, MD 20742, USA"],"affiliations":[{"raw_affiliation_string":"Machine Intelligence and Pattern Analysis Lab, Department of Computer Science, University of Maryland, College Park, MD 20742, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Machine Intelligence and Pattern Analysis Lab., Dept. of Computer Science, University of Maryland, College Park, MD 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029654352"],"corresponding_institution_ids":["https://openalex.org/I1299303238"],"apc_list":{"value":2500,"currency":"USD","value_usd":2500},"apc_paid":null,"fwci":4.4288,"has_fulltext":false,"cited_by_count":65,"citation_normalized_percentile":{"value":0.94893193,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"3","issue":"1","first_page":"7","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12535","display_name":"Machine Learning and Data Classification","score":0.9968000054359436,"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"}},"topics":[{"id":"https://openalex.org/T12535","display_name":"Machine Learning and Data Classification","score":0.9968000054359436,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9860000014305115,"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/T10057","display_name":"Face and Expression Recognition","score":0.983299970626831,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.805727481842041},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6685401201248169},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.606385350227356},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.5752273201942444},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5722165107727051},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5411376953125},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5363895297050476},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5013120174407959},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4220242202281952},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35264188051223755},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18137884140014648},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12038677930831909},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06144288182258606}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.805727481842041},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6685401201248169},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.606385350227356},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.5752273201942444},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5722165107727051},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5411376953125},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5363895297050476},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5013120174407959},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4220242202281952},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35264188051223755},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18137884140014648},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12038677930831909},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06144288182258606},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0167-8655(85)90036-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-8655(85)90036-4","pdf_url":null,"source":{"id":"https://openalex.org/S151820558","display_name":"Pattern Recognition Letters","issn_l":"0167-8655","issn":["0167-8655","1872-7344"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pattern Recognition Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2088171019"],"related_works":["https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W2348092930","https://openalex.org/W2012063272","https://openalex.org/W2138685729","https://openalex.org/W2062850566","https://openalex.org/W4308716484","https://openalex.org/W2098284475","https://openalex.org/W26693340"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}