{"id":"https://openalex.org/W2990525776","doi":"https://doi.org/10.3906/elk-1807-163","title":"A depth-based nearest neighbor algorithm for high-dimensional data classification","display_name":"A depth-based nearest neighbor algorithm for high-dimensional data classification","publication_year":2019,"publication_date":"2019-08-10","ids":{"openalex":"https://openalex.org/W2990525776","doi":"https://doi.org/10.3906/elk-1807-163","mag":"2990525776"},"language":"en","primary_location":{"id":"doi:10.3906/elk-1807-163","is_oa":false,"landing_page_url":"https://doi.org/10.3906/elk-1807-163","pdf_url":null,"source":{"id":"https://openalex.org/S32837994","display_name":"TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES","issn_l":"1300-0632","issn":["1300-0632","1303-6203"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318422","host_organization_name":"Scientific and Technological Research Council of Turkey (TUBITAK)","host_organization_lineage":["https://openalex.org/P4310318422"],"host_organization_lineage_names":["Scientific and Technological Research Council of Turkey (TUBITAK)"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TURKISH JOURNAL OF ELECTRICAL ENGINEERING &amp; COMPUTER SCIENCES","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/A5042124464","display_name":"Sandhya Harikumar","orcid":"https://orcid.org/0000-0003-0236-5532"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sandhya HARIKUMAR","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-0236-5532","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041390156","display_name":"Akhil ARAVINDAKSHAN SAVITHRI","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Akhil ARAVINDAKSHAN SAVITHRI","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-3534-1254","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5078750583","display_name":"Ramachandra Kaimal","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ramachandra KAIMAL","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-1121-1888","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042124464"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5807,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.76726206,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"27","issue":"6","first_page":"4082","last_page":"4101"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11512","display_name":"Anomaly Detection Techniques and Applications","score":0.9959999918937683,"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/T11512","display_name":"Anomaly Detection Techniques and Applications","score":0.9959999918937683,"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/T12535","display_name":"Machine Learning and Data Classification","score":0.9837999939918518,"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/T10057","display_name":"Face and Expression Recognition","score":0.9793000221252441,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.7220778465270996},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7072601914405823},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.6211778521537781},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5746071338653564},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.5737322568893433},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.5657498240470886},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5563313364982605},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.5473461747169495},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5216924548149109},{"id":"https://openalex.org/keywords/large-margin-nearest-neighbor","display_name":"Large margin nearest neighbor","score":0.48623576760292053},{"id":"https://openalex.org/keywords/data-point","display_name":"Data point","score":0.4474602937698364},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.44674408435821533},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.40999501943588257},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3971303105354309}],"concepts":[{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.7220778465270996},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7072601914405823},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.6211778521537781},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5746071338653564},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.5737322568893433},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.5657498240470886},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5563313364982605},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.5473461747169495},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5216924548149109},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.48623576760292053},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.4474602937698364},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.44674408435821533},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.40999501943588257},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3971303105354309},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3906/elk-1807-163","is_oa":false,"landing_page_url":"https://doi.org/10.3906/elk-1807-163","pdf_url":null,"source":{"id":"https://openalex.org/S32837994","display_name":"TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES","issn_l":"1300-0632","issn":["1300-0632","1303-6203"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318422","host_organization_name":"Scientific and Technological Research Council of Turkey (TUBITAK)","host_organization_lineage":["https://openalex.org/P4310318422"],"host_organization_lineage_names":["Scientific and Technological Research Council of Turkey (TUBITAK)"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TURKISH JOURNAL OF ELECTRICAL ENGINEERING &amp; COMPUTER SCIENCES","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2351157934","https://openalex.org/W2795392346","https://openalex.org/W2182477562","https://openalex.org/W4246757943","https://openalex.org/W2969538544","https://openalex.org/W2375128115","https://openalex.org/W1595303882","https://openalex.org/W2519241726","https://openalex.org/W2802487487","https://openalex.org/W1558159560"],"abstract_inverted_index":{"Nearest":[0],"neighbor":[1],"algorithms":[2],"like":[3,51],"k-nearest":[4],"neighbors":[5,99],"(kNN)":[6],"are":[7,31],"fundamental":[8],"supervised":[9],"learning":[10],"techniques":[11],"to":[12,94,151],"classify":[13],"a":[14,89,103,146],"query":[15,104],"instance":[16],"based":[17],"on":[18,127,162],"class":[19],"labels":[20],"of":[21,29,40,53,59,75,80,102,112,124,130,149,156,174],"its":[22],"neighbors.":[23],"However,":[24],"quite":[25],"often,":[26],"huge":[27],"volumes":[28],"datasets":[30,164],"not":[32],"fully":[33],"labeled":[34],"and":[35,61,91,110,118,159,180],"the":[36,41,56,97,128],"unknown":[37],"probability":[38],"distribution":[39],"instances":[42],"may":[43],"be":[44],"uneven.":[45],"Moreover,":[46],"kNN":[47],"suffers":[48],"from":[49,84],"challenges":[50],"curse":[52],"dimensionality,":[54],"setting":[55],"optimal":[57],"number":[58],"neighbors,":[60],"scalability":[62],"for":[63,100,177],"high-dimensional":[64,85,178],"data.":[65,86],"To":[66],"overcome":[67],"these":[68],"challenges,":[69],"we":[70],"propose":[71,140],"an":[72,121,141],"improvised":[73,142],"approach":[74,93,168],"classification":[76,101,143],"via":[77],"depth":[78,137],"representation":[79,148],"subspace":[81],"clusters":[82],"formed":[83],"We":[87,139],"offer":[88],"consistent":[90],"principled":[92],"dynamically":[95],"choose":[96],"nearest":[98],"point":[105],"by":[106,132],"i)":[107],"identifying":[108],"structures":[109],"distributions":[111],"data;":[113],"ii)":[114],"extracting":[115],"relevant":[116],"features,":[117],"iii)":[119],"deriving":[120],"optimum":[122],"value":[123],"k":[125],"depending":[126],"structure":[129],"data":[131,134,136],"representing":[133],"using":[135,145],"function.":[138],"algorithm":[144],"depth-based":[147],"clusters,":[150],"improve":[152],"performance":[153],"in":[154],"terms":[155],"execution":[157],"time":[158],"accuracy.":[160],"Experimentation":[161],"real-world":[163],"reveals":[165],"that":[166],"proposed":[167],"is":[169,181],"at":[170,182],"least":[171,183],"two":[172],"orders":[173],"magnitude":[175],"faster":[176],"dataset":[179],"as":[184,186],"accurate":[185],"traditional":[187],"kNN.":[188]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2025-10-10T00:00:00"}
