{"id":"https://openalex.org/W2116596942","doi":"https://doi.org/10.1109/tpami.2002.1033219","title":"Locally adaptive metric nearest-neighbor classification","display_name":"Locally adaptive metric nearest-neighbor classification","publication_year":2002,"publication_date":"2002-09-01","ids":{"openalex":"https://openalex.org/W2116596942","doi":"https://doi.org/10.1109/tpami.2002.1033219","mag":"2116596942"},"language":"en","primary_location":{"id":"doi:10.1109/tpami.2002.1033219","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpami.2002.1033219","pdf_url":null,"source":{"id":"https://openalex.org/S199944782","display_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","issn_l":"0162-8828","issn":["0162-8828","1939-3539","2160-9292"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","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 Pattern Analysis and Machine Intelligence","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/A5090148962","display_name":"Carlotta Domeniconi","orcid":"https://orcid.org/0000-0003-2140-9596"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Domeniconi","raw_affiliation_strings":["Computer Science Department, University of California Riverside, Riverside, CA, USA","Dept. of Comput. Sci., California, Univ., Riverside, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of California Riverside, Riverside, CA, USA","institution_ids":["https://openalex.org/I103635307"]},{"raw_affiliation_string":"Dept. of Comput. Sci., California, Univ., Riverside, CA, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101892033","display_name":"Jing Peng","orcid":"https://orcid.org/0000-0001-8822-310X"},"institutions":[{"id":"https://openalex.org/I114832834","display_name":"Tulane University","ror":"https://ror.org/04vmvtb21","country_code":"US","type":"education","lineage":["https://openalex.org/I114832834"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jing Peng","raw_affiliation_strings":["Electrical Engineering and Computer Science Department, Tulane University, New Orleans, LA, USA","[Electrical Engineering and Computer Science Department, Tulane University, New Orleans, LA, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science Department, Tulane University, New Orleans, LA, USA","institution_ids":["https://openalex.org/I114832834"]},{"raw_affiliation_string":"[Electrical Engineering and Computer Science Department, Tulane University, New Orleans, LA, USA]","institution_ids":["https://openalex.org/I114832834"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063685438","display_name":"Dimitrios Gunopulos","orcid":"https://orcid.org/0000-0001-6339-1879"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Gunopulos","raw_affiliation_strings":["Computer Science Department, University of California Riverside, Riverside, CA, USA","Comput. Sci. Dept., Univ. of California, Riverside, Riverside, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of California Riverside, Riverside, CA, USA","institution_ids":["https://openalex.org/I103635307"]},{"raw_affiliation_string":"Comput. Sci. Dept., Univ. of California, Riverside, Riverside, CA, USA","institution_ids":["https://openalex.org/I103635307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.0797,"has_fulltext":false,"cited_by_count":308,"citation_normalized_percentile":{"value":0.98007131,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"24","issue":"9","first_page":"1281","last_page":"1285"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.9975000023841858,"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/T10057","display_name":"Face and Expression Recognition","score":0.9975000023841858,"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/T10136","display_name":"Statistical Methods and Inference","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11871","display_name":"Advanced Statistical Methods and Models","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.809444785118103},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.7075418829917908},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6714630126953125},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.6592813730239868},{"id":"https://openalex.org/keywords/large-margin-nearest-neighbor","display_name":"Large margin nearest neighbor","score":0.6526903510093689},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.6221726536750793},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5453053116798401},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.5372197031974792},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.5229502320289612},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47682470083236694},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.455799400806427},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.43317484855651855},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42580902576446533},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.357405424118042},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.08953145146369934}],"concepts":[{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.809444785118103},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.7075418829917908},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6714630126953125},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.6592813730239868},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.6526903510093689},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.6221726536750793},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5453053116798401},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.5372197031974792},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.5229502320289612},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47682470083236694},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.455799400806427},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.43317484855651855},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42580902576446533},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.357405424118042},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.08953145146369934},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"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":4,"locations":[{"id":"doi:10.1109/tpami.2002.1033219","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpami.2002.1033219","pdf_url":null,"source":{"id":"https://openalex.org/S199944782","display_name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","issn_l":"0162-8828","issn":["0162-8828","1939-3539","2160-9292"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","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 Pattern Analysis and Machine Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.33.4419","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.4419","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucr.edu/~carlotta/UCR_CSE_00_01.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.409.4498","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.4498","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs.gmu.edu/~carlotta/publications/pami.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.409.740","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.740","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs.gmu.edu/~carlotta/publications/cvpr.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1689445748","https://openalex.org/W2017977879","https://openalex.org/W2035871002","https://openalex.org/W2037753653","https://openalex.org/W2056763477","https://openalex.org/W2059507684","https://openalex.org/W2084134149","https://openalex.org/W2088779313","https://openalex.org/W2091632079","https://openalex.org/W2103116581","https://openalex.org/W2125055259","https://openalex.org/W2129476886","https://openalex.org/W2490800645","https://openalex.org/W2911678770","https://openalex.org/W2912934387","https://openalex.org/W3017143921","https://openalex.org/W4212883601","https://openalex.org/W4213251304","https://openalex.org/W4237171445","https://openalex.org/W4255930413"],"related_works":["https://openalex.org/W2182477562","https://openalex.org/W2795392346","https://openalex.org/W2351157934","https://openalex.org/W4246757943","https://openalex.org/W2011582495","https://openalex.org/W2375128115","https://openalex.org/W1595303882","https://openalex.org/W1558159560","https://openalex.org/W2969538544","https://openalex.org/W2245581955"],"abstract_inverted_index":{"Nearest-neighbor":[0],"classification":[1,43,100],"assumes":[2],"locally":[3,40],"constant":[4],"class":[5,89],"conditional":[6,90],"probabilities.":[7],"This":[8],"assumption":[9],"becomes":[10],"invalid":[11],"in":[12,94],"high":[13],"dimensions":[14,78],"with":[15],"finite":[16],"samples":[17],"due":[18],"to":[19,45,47,56,68],"the":[20,34,88,95],"curse":[21],"of":[22,107],"dimensionality.":[23],"Severe":[24],"bias":[25],"can":[26,102],"be":[27,103],"introduced":[28],"under":[29],"these":[30],"conditions":[31],"when":[32],"using":[33,117],"nearest-neighbor":[35,42],"rule.":[36],"We":[37,50],"propose":[38],"a":[39,52,58,86],"adaptive":[41,67],"method":[44,109],"try":[46],"minimize":[48],"bias.":[49],"use":[51],"chi-squared":[53],"distance":[54],"analysis":[55],"compute":[57],"flexible":[59],"metric":[60],"for":[61],"producing":[62],"neighborhoods":[63],"that":[64],"are":[65,72,92],"highly":[66],"query":[69],"locations.":[70],"Neighborhoods":[71],"elongated":[73],"along":[74,81],"less":[75],"relevant":[76],"feature":[77],"and":[79,112,120],"constricted":[80],"most":[82],"influential":[83],"ones.":[84],"As":[85],"result,":[87],"probabilities":[91],"smoother":[93],"modified":[96],"neighborhoods,":[97],"whereby":[98],"better":[99],"performance":[101],"achieved.":[104],"The":[105],"efficacy":[106],"our":[108],"is":[110],"validated":[111],"compared":[113],"against":[114],"other":[115],"techniques":[116],"both":[118],"simulated":[119],"real-world":[121],"data.":[122]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":15},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":23},{"year":2013,"cited_by_count":16},{"year":2012,"cited_by_count":17}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}