{"id":"https://openalex.org/W1994410331","doi":"https://doi.org/10.1109/tit.1968.1054155","title":"The condensed nearest neighbor rule (Corresp.)","display_name":"The condensed nearest neighbor rule (Corresp.)","publication_year":1968,"publication_date":"1968-05-01","ids":{"openalex":"https://openalex.org/W1994410331","doi":"https://doi.org/10.1109/tit.1968.1054155","mag":"1994410331"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1968.1054155","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1968.1054155","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","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/A5091275445","display_name":"Peter E. Hart","orcid":"https://orcid.org/0000-0002-0128-168X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"P. Hart","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5091275445"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7181,"has_fulltext":false,"cited_by_count":1720,"citation_normalized_percentile":{"value":0.82646277,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"14","issue":"3","first_page":"515","last_page":"516"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.12700000405311584,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11727","display_name":"Advanced Algebra and Logic","score":0.12700000405311584,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6748528480529785},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.5494461059570312},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.4268735349178314},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4029795825481415},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3803462088108063},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.3279408812522888},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32421910762786865},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.28843146562576294},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.08198270201683044}],"concepts":[{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6748528480529785},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.5494461059570312},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.4268735349178314},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4029795825481415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3803462088108063},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3279408812522888},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32421910762786865},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28843146562576294},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.08198270201683044},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1968.1054155","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1968.1054155","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1515456194","https://openalex.org/W2044523229","https://openalex.org/W2056551493","https://openalex.org/W2122111042","https://openalex.org/W3199729985"],"related_works":["https://openalex.org/W2375128115","https://openalex.org/W2519241726","https://openalex.org/W2182477562","https://openalex.org/W2011582495","https://openalex.org/W2245581955","https://openalex.org/W4297819076","https://openalex.org/W1671890395","https://openalex.org/W2351157934","https://openalex.org/W325985789","https://openalex.org/W2062957446"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":11},{"year":2025,"cited_by_count":62},{"year":2024,"cited_by_count":83},{"year":2023,"cited_by_count":96},{"year":2022,"cited_by_count":108},{"year":2021,"cited_by_count":104},{"year":2020,"cited_by_count":92},{"year":2019,"cited_by_count":88},{"year":2018,"cited_by_count":73},{"year":2017,"cited_by_count":67},{"year":2016,"cited_by_count":70},{"year":2015,"cited_by_count":54},{"year":2014,"cited_by_count":64},{"year":2013,"cited_by_count":56},{"year":2012,"cited_by_count":63}],"updated_date":"2026-04-22T08:38:42.863108","created_date":"2025-10-10T00:00:00"}