{"id":"https://openalex.org/W1985712316","doi":"https://doi.org/10.1109/fskd.2010.5569740","title":"An adaptive k-nearest neighbor algorithm","display_name":"An adaptive k-nearest neighbor algorithm","publication_year":2010,"publication_date":"2010-08-01","ids":{"openalex":"https://openalex.org/W1985712316","doi":"https://doi.org/10.1109/fskd.2010.5569740","mag":"1985712316"},"language":"en","primary_location":{"id":"doi:10.1109/fskd.2010.5569740","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fskd.2010.5569740","pdf_url":null,"source":{"id":"https://openalex.org/S4363608217","display_name":"2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery","raw_type":"proceedings-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/A5047846625","display_name":"Shiliang Sun","orcid":"https://orcid.org/0000-0001-7069-3752"},"institutions":[{"id":"https://openalex.org/I66867065","display_name":"East China Normal University","ror":"https://ror.org/02n96ep67","country_code":"CN","type":"education","lineage":["https://openalex.org/I66867065"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Shiliang Sun","raw_affiliation_strings":["Department of Computer Science and Technology, East China Jiao Tong University, Shanghai, China","Department of Computer Science and Technology, East China Normal University, 500 Dongchuan Road, Shanghai 200241, China#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, East China Jiao Tong University, Shanghai, China","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science and Technology, East China Normal University, 500 Dongchuan Road, Shanghai 200241, China#TAB#","institution_ids":["https://openalex.org/I66867065"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110198056","display_name":"Rongqing Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I66867065","display_name":"East China Normal University","ror":"https://ror.org/02n96ep67","country_code":"CN","type":"education","lineage":["https://openalex.org/I66867065"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Rongqing Huang","raw_affiliation_strings":["Department of Computer Science and Technology, East China Jiao Tong University, Shanghai, China","Department of Computer Science and Technology, East China Normal University, 500 Dongchuan Road, Shanghai 200241, China#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, East China Jiao Tong University, Shanghai, China","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science and Technology, East China Normal University, 500 Dongchuan Road, Shanghai 200241, China#TAB#","institution_ids":["https://openalex.org/I66867065"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047846625"],"corresponding_institution_ids":["https://openalex.org/I66867065"],"apc_list":null,"apc_paid":null,"fwci":6.1651,"has_fulltext":false,"cited_by_count":225,"citation_normalized_percentile":{"value":0.97062084,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"91","last_page":"94"},"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.9955999851226807,"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.9955999851226807,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9954000115394592,"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/T11550","display_name":"Text and Document Classification Technologies","score":0.9940000176429749,"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/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.8675881028175354},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.7281297445297241},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.70585036277771},{"id":"https://openalex.org/keywords/large-margin-nearest-neighbor","display_name":"Large margin nearest neighbor","score":0.6906650066375732},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6314489245414734},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6224855184555054},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.49175742268562317},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48839157819747925},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.4349159300327301},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3906499743461609},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.11724001169204712}],"concepts":[{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.8675881028175354},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.7281297445297241},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.70585036277771},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.6906650066375732},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6314489245414734},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6224855184555054},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.49175742268562317},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48839157819747925},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.4349159300327301},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3906499743461609},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.11724001169204712},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fskd.2010.5569740","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fskd.2010.5569740","pdf_url":null,"source":{"id":"https://openalex.org/S4363608217","display_name":"2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W129457532","https://openalex.org/W175858947","https://openalex.org/W1991482408","https://openalex.org/W2057175746","https://openalex.org/W2062957446","https://openalex.org/W2091632079","https://openalex.org/W2092022777","https://openalex.org/W2106053110","https://openalex.org/W2114004713","https://openalex.org/W2114535528","https://openalex.org/W2130695501","https://openalex.org/W2137291015","https://openalex.org/W2149684865","https://openalex.org/W2165888424","https://openalex.org/W2952879406","https://openalex.org/W3016210511","https://openalex.org/W3017143921","https://openalex.org/W6605134655","https://openalex.org/W6675751002","https://openalex.org/W6680112165","https://openalex.org/W6682304300","https://openalex.org/W6765133963"],"related_works":["https://openalex.org/W2375128115","https://openalex.org/W2182477562","https://openalex.org/W2351157934","https://openalex.org/W2795392346","https://openalex.org/W2969538544","https://openalex.org/W2519241726","https://openalex.org/W1595303882","https://openalex.org/W4246757943","https://openalex.org/W1558159560","https://openalex.org/W325985789"],"abstract_inverted_index":{"An":[0],"adaptive":[1],"k-nearest":[2,19],"neighbor":[3,20,120],"algorithm":[4,21,58,72,130,142],"(AdaNN)":[5],"is":[6,37,131],"brought":[7],"forward":[8],"in":[9,121],"this":[10],"paper":[11],"to":[12,91,109],"overcome":[13],"the":[14,17,26,40,48,51,63,75,78,81,103,111,114,122,128,146],"limitation":[15],"of":[16,29,42,50,80,117,127],"traditional":[18,147],"(kNN)":[22],"which":[23],"usually":[24],"identifies":[25],"same":[27,112],"number":[28,79],"nearest":[30,83,119],"neighbors":[31,84],"for":[32,66],"each":[33,67,99],"test":[34,68,100],"example.":[35,69],"It":[36],"known":[38],"that":[39,85,140],"value":[41],"k":[43,65,108,116],"has":[44],"crucial":[45],"influence":[46],"on":[47,60,133],"performance":[49,126],"kNN":[52,57,104,148],"algorithm,":[53,105],"and":[54],"our":[55,141],"improved":[56],"focuses":[59],"finding":[61],"out":[62,74],"suitable":[64],"The":[70,125],"proposed":[71,129],"finds":[73],"optimal":[76,115],"k,":[77],"fewest":[82],"every":[86],"training":[87,123],"example":[88,101],"can":[89],"use":[90],"get":[92],"its":[93,118],"correct":[94],"class":[95],"label.":[96],"For":[97],"classifying":[98],"using":[102],"we":[106],"set":[107],"be":[110],"as":[113],"set.":[124],"tested":[132],"several":[134],"data":[135],"sets.":[136],"Experimental":[137],"results":[138],"indicate":[139],"performs":[143],"better":[144],"than":[145],"algorithm.":[149]},"counts_by_year":[{"year":2026,"cited_by_count":6},{"year":2025,"cited_by_count":21},{"year":2024,"cited_by_count":34},{"year":2023,"cited_by_count":37},{"year":2022,"cited_by_count":34},{"year":2021,"cited_by_count":31},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-05-22T09:01:20.584952","created_date":"2025-10-10T00:00:00"}