{"id":"https://openalex.org/W7225374223","doi":"https://doi.org/10.66977/xsci.2611.000t","title":"Evolutionary Adaptive Neighborhood Learning: A Genetic Algorithm for Instance-Dependent k Optimization in Nearest Neighbor Classification","display_name":"Evolutionary Adaptive Neighborhood Learning: A Genetic Algorithm for Instance-Dependent k Optimization in Nearest Neighbor Classification","publication_year":2026,"publication_date":"2026-11-06","ids":{"openalex":"https://openalex.org/W7225374223","doi":"https://doi.org/10.66977/xsci.2611.000t"},"language":"en","primary_location":{"id":"doi:10.66977/xsci.2611.000t","doi":"https://doi.org/10.66977/xsci.2611.000t","is_oa":true,"landing_page_url":"https://doi.org/10.66977/xsci.2611.000t","pdf_url":"https://xsci.com/preprint/doi/10.66977/xsci.2611.000t.pdf","source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://xsci.com/preprint/doi/10.66977/xsci.2611.000t.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5118837785","display_name":"Isaac Touza","orcid":"https://orcid.org/0009-0003-6288-9458","observed_orcids":["https://orcid.org/0009-0003-6288-9458"]},"institutions":[{"id":"https://openalex.org/I213072177","display_name":"University of Maroua","ror":"https://ror.org/051sa4h84","country_code":"CM","type":"education","lineage":["https://openalex.org/I213072177"]}],"countries":["CM"],"is_corresponding":false,"raw_author_name":"Isaac Touza","raw_affiliation_strings":["Department of Mathematics and Computer Science , Faculty of Science , University of Maroua , P.O. Box 814 , Maroua , Cameroon","Laboratoire de Recherche en Informatique (LaRI) , University of Maroua , Maroua , Cameroon"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science , Faculty of Science , University of Maroua , P.O. Box 814 , Maroua , Cameroon","institution_ids":["https://openalex.org/I213072177"]},{"raw_affiliation_string":"Laboratoire de Recherche en Informatique (LaRI) , University of Maroua , Maroua , Cameroon","institution_ids":["https://openalex.org/I213072177"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5159980370","display_name":"Kaladzavi Guidedi","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kaladzavi Guidedi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5081725106","display_name":"Kolyang","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kolyang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.4381999969482422,"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.4381999969482422,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.28369998931884766,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.23970000445842743,"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-neighbour-classification","display_name":"k-nearest neighbour classification","score":0.8029999732971191},{"id":"https://openalex.org/keywords/hyperparameter-optimization","display_name":"hyperparameter optimization","score":0.5950000286102295},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.8460000157356262},{"id":"https://openalex.org/keywords/bias-variance-trade-off","display_name":"bias-variance trade-off","score":0.8100000023841858},{"id":"https://openalex.org/keywords/generalization-bounds","display_name":"generalization bounds","score":0.6050000190734863},{"id":"https://openalex.org/keywords/growth-functions","display_name":"growth functions","score":0.746999979019165},{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.6600000262260437},{"id":"https://openalex.org/keywords/noisy-labels","display_name":"label noise","score":0.5770000219345093},{"id":"https://openalex.org/keywords/neighborhood-density","display_name":"neighborhood density","score":0.5019999742507935}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6654999852180481},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.6159999966621399},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.5264999866485596},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.49129998683929443},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4641999900341034},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.4180999994277954},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3700000047683716},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36059999465942383},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35280001163482666},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.3504999876022339},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.3504999876022339},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.3353999853134155},{"id":"https://openalex.org/C146324458","wikidata":"https://www.wikidata.org/wiki/Q1202673","display_name":"Uniform norm","level":2,"score":0.3310999870300293},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.3246999979019165},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3183000087738037},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28600001335144043},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.2799000144004822},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.2775000035762787},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26820001006126404},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.2660999894142151},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.26600000262260437},{"id":"https://openalex.org/C2778049214","wikidata":"https://www.wikidata.org/wiki/Q7512234","display_name":"Sigma","level":2,"score":0.26489999890327454},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.262800008058548},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2624000012874603},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.2605000138282776},{"id":"https://openalex.org/C171752962","wikidata":"https://www.wikidata.org/wiki/Q255166","display_name":"Kullback\u2013Leibler divergence","level":2,"score":0.257099986076355},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.2547999918460846},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.2526000142097473}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.66977/xsci.2611.000t","doi":"https://doi.org/10.66977/xsci.2611.000t","is_oa":true,"landing_page_url":"https://doi.org/10.66977/xsci.2611.000t","pdf_url":"https://xsci.com/preprint/doi/10.66977/xsci.2611.000t.pdf","source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"}],"best_oa_location":{"id":"doi:10.66977/xsci.2611.000t","doi":"https://doi.org/10.66977/xsci.2611.000t","is_oa":true,"landing_page_url":"https://doi.org/10.66977/xsci.2611.000t","pdf_url":"https://xsci.com/preprint/doi/10.66977/xsci.2611.000t.pdf","source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7225374223.pdf","grobid_xml":"https://content.openalex.org/works/W7225374223.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1545745930","https://openalex.org/W1564947197","https://openalex.org/W1965524806","https://openalex.org/W1971361630","https://openalex.org/W2059507684","https://openalex.org/W2081475785","https://openalex.org/W2097996627","https://openalex.org/W2101234009","https://openalex.org/W2105223996","https://openalex.org/W2108882154","https://openalex.org/W2120199131","https://openalex.org/W2122111042","https://openalex.org/W2130695501","https://openalex.org/W2135190479","https://openalex.org/W2137207609","https://openalex.org/W2141007997","https://openalex.org/W2161392888","https://openalex.org/W2162232298","https://openalex.org/W2314633289","https://openalex.org/W2496613022","https://openalex.org/W2606436201","https://openalex.org/W2794590714","https://openalex.org/W2970793960","https://openalex.org/W3109994111","https://openalex.org/W4238284510","https://openalex.org/W4406047371"],"related_works":["https://openalex.org/W181904300","https://openalex.org/W2050019692","https://openalex.org/W3126623229","https://openalex.org/W66929277","https://openalex.org/W1122942834","https://openalex.org/W2781717301","https://openalex.org/W6986541125","https://openalex.org/W2081220126","https://openalex.org/W2176705192","https://openalex.org/W4403617526"],"abstract_inverted_index":{"The":[0],"number":[1,115],"of":[2,9,94,98,116,127,175],"neighbours":[3,117],"$k$":[4,35,161,252],"is":[5,17,36,57,182,278,288],"the":[6,10,30,53,74,95,124,128,158,172,176,185,197,234,241,249,268,282,292,297,309],"central":[7],"hyper-parameter":[8],"$k$-nearest":[11],"neighbour":[12],"($k$-NN)":[13],"classifier,":[14],"and":[15,187,237,244,286,301,304],"it":[16,245,287,307],"almost":[18,169],"always":[19],"chosen":[20],"globally,":[21],"by":[22,26,62,133],"cross-validation":[23],"or,":[24],"increasingly,":[25],"evolutionary":[27],"search.":[28],"Yet":[29],"bias--variance":[31],"trade-off":[32],"that":[33,150,209],"governs":[34],"local:":[37],"dense,":[38],"noise-free":[39],"regions":[40,48],"favour":[41,49],"small":[42,231],"neighbourhoods,":[43],"whereas":[44],"sparse":[45],"or":[46],"label-noisy":[47],"large":[50,238],"ones.":[51],"Because":[52],"global-$k$":[54,284],"search":[55,61],"space":[56],"one-dimensional,":[58],"replacing":[59],"exhaustive":[60],"a":[63,87,92,99,134,192,205,222,258],"genetic":[64],"algorithm":[65],"(GA)":[66],"cannot":[67],"improve":[68],"on":[69,162,213,262],"it.":[70],"We":[71,78,148,295],"therefore":[72],"change":[73],"object":[75],"being":[76],"optimised.":[77],"propose":[79],"EANK":[80,153,229,266],"(Evolutionary":[81],"Adaptive":[82],"Neighborhood":[83],"$K$),":[84],"which":[85,215],"evolves":[86],"low-dimensional":[88],"policy":[89,189],"$g_\\theta$":[90],"mapping":[91],"description":[93],"local":[96],"neighbourhood":[97,180],"point":[100],"(density,":[101],"label":[102],"entropy":[103],"at":[104,253],"two":[105],"scales,":[106],"vote":[107,139],"margin,":[108],"concentration,":[109],"relative":[110],"density)":[111],"to":[112,145,171],"an":[113],"instance-dependent":[114],"$k(x)\\in\\{1,\\dots,K\\}$.":[118],"A":[119,137],"real-coded":[120],"elitist":[121],"GA":[122,167],"maximises":[123],"leave-one-out":[125],"accuracy":[126,247,277],"induced":[129],"adaptive":[130],"rule,":[131],"penalised":[132],"neighbourhood-smoothness":[135],"term.":[136],"pre-computed":[138],"table":[140],"reduces":[141],"each":[142],"fitness":[143],"evaluation":[144,261],"$O(n)$":[146],"look-ups.":[147],"prove":[149],"(i)~a":[151],"seeded":[152],"never":[154],"does":[155,210],"worse":[156],"than":[157,291],"best":[159,250,269],"global":[160,251],"its":[163],"training":[164],"criterion,":[165],"(ii)~the":[166],"converges":[168],"surely":[170],"essential":[173],"supremum":[174],"fitness,":[177],"(iii)~the":[178],"learned":[179],"size":[181,199],"Lipschitz":[183],"in":[184,196,233,240],"meta-features,":[186],"(iv)~the":[188],"class":[190],"has":[191],"growth":[193],"function":[194],"polynomial":[195],"sample":[198],"with":[200,225],"exponent":[201],"$d+2$.":[202],"This":[203],"yields":[204],"uniform":[206],"generalisation":[207],"bound":[208],"not":[211,219],"depend":[212],"$n$,":[214],"per-instance":[216],"encodings":[217],"do":[218],"enjoy.":[220],"On":[221],"controlled":[223],"benchmark":[224],"spatially":[226],"heterogeneous":[227],"structure,":[228],"recovers":[230],"neighbourhoods":[232],"fine-grained":[235],"region":[236],"ones":[239],"noisy":[242],"region,":[243],"improves":[246],"over":[248],"every":[254],"noise":[255],"level.":[256],"In":[257],"nested,":[259],"$5\\times5$-fold":[260],"twelve":[263],"public":[264],"datasets,":[265],"obtains":[267],"average":[270],"rank":[271],"among":[272],"six":[273],"$k$-NN":[274],"variants.":[275],"Its":[276],"statistically":[279],"indistinguishable":[280],"from":[281],"tuned":[283],"baselines,":[285],"significantly":[289],"better":[290],"default":[293],"$k=5$.":[294],"document":[296],"gap":[298],"between":[299],"in-sample":[300],"out-of-sample":[302],"gains,":[303],"we":[305],"identify":[306],"as":[308],"main":[310],"obstacle":[311],"for":[312],"adaptive-neighbourhood":[313],"methods.":[314]},"counts_by_year":[],"updated_date":"2026-11-09T13:22:03.289127","created_date":"2026-11-07T00:00:00"}