{"id":"https://openalex.org/W7097401340","doi":null,"title":"Adaptive k-Nearest Neighbor Classification Based on a Dynamic Number of Nearest Neighbors","display_name":"Adaptive k-Nearest Neighbor Classification Based on a Dynamic Number of Nearest Neighbors","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7097401340"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.79.9645","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.9645","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://delab.csd.auth.gr/papers/ADBIS07onpmw.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7097401340"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5043003448","display_name":"Stefanos Ougiaroglou","orcid":"https://orcid.org/0000-0003-1094-2520","observed_orcids":["https://orcid.org/0000-0003-1094-2520"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Stefanos Ougiaroglou","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108354882","display_name":"\u0391\u03bb\u03ad\u03be\u03b1\u03bd\u03b4\u03c1\u03bf\u03c2 \u039d\u03b1\u03bd\u03cc\u03c0\u03bf\u03c5\u03bb\u03bf\u03c2","orcid":"https://orcid.org/0009-0008-0515-7230","observed_orcids":["https://orcid.org/0009-0008-0515-7230"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Alexandros Nanopoulos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Apostolos N. Papadopoulos","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Apostolos N. Papadopoulos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Yannis Manolopoulos","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Yannis Manolopoulos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5109373134","display_name":"Tatjana Welzer-Dru\u017eovec","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Tatjana Welzer-druzovec","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"reviewed_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_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.3375999927520752,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11106","display_name":"Data Management and Algorithms","score":0.3375999927520752,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T13373","display_name":"Data Mining and Machine Learning Applications","score":0.1858000010251999,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T12535","display_name":"Machine Learning and Data Classification","score":0.1476999968290329,"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","display_name":"k-nearest neighbors","score":0.9789999723434448},{"id":"https://openalex.org/keywords/indexing-schemes","display_name":"indexing schemes","score":0.47699999809265137},{"id":"https://openalex.org/keywords/computational-cost-reduction","display_name":"computational complexity reduction","score":0.8550000190734863},{"id":"https://openalex.org/keywords/classification-precision","display_name":"classification precision","score":0.6890000104904175}],"concepts":[{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6930999755859375},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6791999936103821},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.6244000196456909},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5924999713897705},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.586899995803833},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5537999868392944},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5370000004768372},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.511900007724762},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.5038999915122986},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.4959999918937683},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.4219000041484833},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.4194999933242798},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40720000863075256},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.39899998903274536},{"id":"https://openalex.org/C110083411","wikidata":"https://www.wikidata.org/wiki/Q1744628","display_name":"Statistical classification","level":2,"score":0.39250001311302185},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.38519999384880066},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33320000767707825},{"id":"https://openalex.org/C66905080","wikidata":"https://www.wikidata.org/wiki/Q17005494","display_name":"Binary classification","level":3,"score":0.32280001044273376},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.31150001287460327},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.28209999203681946},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2556000053882599},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.79.9645","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.9645","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://delab.csd.auth.gr/papers/ADBIS07onpmw.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2134855596","https://openalex.org/W99247485","https://openalex.org/W3126623229","https://openalex.org/W7096736047","https://openalex.org/W2153604224","https://openalex.org/W1985712316","https://openalex.org/W2114909992","https://openalex.org/W2606436201","https://openalex.org/W3037026157","https://openalex.org/W2176705192"],"abstract_inverted_index":{"Abstract.":[0],"Classification":[1],"based":[2,181],"on":[3,39,182],"k-nearest":[4],"neighbors":[5,22,84,136],"(kNN":[6],"classification)":[7],"is":[8,31,36,50,59,85],"one":[9],"of":[10,20,47,57,82,89,108,132,137,189],"the":[11,40,45,52,63,75,79,87,106,109,130,148,187,190],"most":[12],"widely":[13],"used":[14,23,72],"classification":[15,30,76,173],"methods.":[16,199],"The":[17],"number":[18,81],"k":[19,134],"nearest":[21,83,110,135,149],"for":[24],"achieving":[25,194],"a":[26,124,138,176],"high":[27,98,177],"precision":[28,174],"in":[29,33,193],"given":[32],"advance":[34],"and":[35,163,170],"highly":[37],"dependent":[38],"data":[41,48,184],"set":[42,49],"used.":[43],"If":[44,78],"size":[46],"large,":[51],"sequential":[53],"or":[54],"binary":[55],"search":[56,112],"NNs":[58],"inapplicable":[60],"due":[61],"to":[62,73,96],"increased":[64],"computational":[65],"costs.":[66],"Therefore,":[67],"indexing":[68],"schemes":[69],"are":[70,120,144],"frequently":[71],"speed-up":[74],"process.":[77],"required":[80],"high,":[86],"use":[88],"an":[90,153],"index":[91],"may":[92],"not":[93],"be":[94,115,127],"adequate":[95],"achieve":[97],"performance.":[99],"In":[100],"this":[101],"paper,":[102],"we":[103],"demonstrate":[104],"that":[105],"execution":[107],"neighbor":[111,150],"algorithm":[113,151],"can":[114,126],"interrupted":[116],"if":[117],"some":[118],"criteria":[119],"satisfied.":[121],"This":[122],"way,":[123],"decision":[125],"made":[128],"without":[129],"computation":[131,162],"all":[133],"new":[139],"object.":[140],"Three":[141],"different":[142],"heuristics":[143,157],"studied":[145],"towards":[146],"enhancing":[147],"with":[152],"early-break":[154],"capability.":[155],"These":[156],"aim":[158],"at:":[159],"(i)":[160],"reducing":[161],"I/O":[164],"costs":[165],"as":[166,168],"much":[167],"possible,":[169],"(ii)":[171],"maintaining":[172],"at":[175],"level.":[178],"Experimental":[179],"results":[180],"real-life":[183],"sets":[185],"illustrate":[186],"applicability":[188],"proposed":[191],"method":[192],"better":[195],"performance":[196],"than":[197],"existing":[198]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7097401340","counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2025-10-27T00:00:00"}
