{"id":"https://openalex.org/W3090419440","doi":"https://doi.org/10.1109/ijcnn48605.2020.9207321","title":"k-Nearest Neighbor based Clustering with Shape Alternation Adaptivity","display_name":"k-Nearest Neighbor based Clustering with Shape Alternation Adaptivity","publication_year":2020,"publication_date":"2020-07-01","ids":{"openalex":"https://openalex.org/W3090419440","doi":"https://doi.org/10.1109/ijcnn48605.2020.9207321","mag":"3090419440"},"language":"en","primary_location":{"id":"doi:10.1109/ijcnn48605.2020.9207321","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn48605.2020.9207321","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 International Joint Conference on Neural Networks (IJCNN)","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/A5069653714","display_name":"Yifeng Lu","orcid":"https://orcid.org/0000-0003-1973-818X"},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Yifeng Lu","raw_affiliation_strings":["Database Systems and Data Mining Group, LMU, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Database Systems and Data Mining Group, LMU, Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100446990","display_name":"Yao Zhang","orcid":"https://orcid.org/0000-0002-7375-9152"},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Yao Zhang","raw_affiliation_strings":["Database Systems and Data Mining Group, LMU, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Database Systems and Data Mining Group, LMU, Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058235831","display_name":"Florian Richter","orcid":"https://orcid.org/0000-0002-7669-1923"},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Florian Richter","raw_affiliation_strings":["Database Systems and Data Mining Group, LMU, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Database Systems and Data Mining Group, LMU, Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003335849","display_name":"Thomas Seidl","orcid":"https://orcid.org/0000-0002-4861-1412"},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Seidl","raw_affiliation_strings":["Database Systems and Data Mining Group, LMU, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Database Systems and Data Mining Group, LMU, Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5069653714"],"corresponding_institution_ids":["https://openalex.org/I8204097"],"apc_list":null,"apc_paid":null,"fwci":0.2651,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.63572986,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9994000196456909,"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9994000196456909,"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/T11106","display_name":"Data Management and Algorithms","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9797999858856201,"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/cluster-analysis","display_name":"Cluster analysis","score":0.827851414680481},{"id":"https://openalex.org/keywords/dbscan","display_name":"DBSCAN","score":0.778226375579834},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7293211817741394},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.5628765821456909},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5474737286567688},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5181509256362915},{"id":"https://openalex.org/keywords/single-linkage-clustering","display_name":"Single-linkage clustering","score":0.5109964609146118},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.49759867787361145},{"id":"https://openalex.org/keywords/determining-the-number-of-clusters-in-a-data-set","display_name":"Determining the number of clusters in a data set","score":0.47113436460494995},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.4388793706893921},{"id":"https://openalex.org/keywords/data-point","display_name":"Data point","score":0.437051385641098},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.39117857813835144},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.38862869143486023},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.36849313974380493},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.332227885723114},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.206182599067688}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.827851414680481},{"id":"https://openalex.org/C46576248","wikidata":"https://www.wikidata.org/wiki/Q1114630","display_name":"DBSCAN","level":5,"score":0.778226375579834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7293211817741394},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.5628765821456909},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5474737286567688},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5181509256362915},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.5109964609146118},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.49759867787361145},{"id":"https://openalex.org/C149872217","wikidata":"https://www.wikidata.org/wiki/Q5265701","display_name":"Determining the number of clusters in a data set","level":5,"score":0.47113436460494995},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.4388793706893921},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.437051385641098},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.39117857813835144},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.38862869143486023},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.36849313974380493},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.332227885723114},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.206182599067688},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ijcnn48605.2020.9207321","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn48605.2020.9207321","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 International Joint Conference on Neural Networks (IJCNN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W9613553","https://openalex.org/W151377110","https://openalex.org/W839407891","https://openalex.org/W1979896142","https://openalex.org/W1987971958","https://openalex.org/W2018359542","https://openalex.org/W2029073757","https://openalex.org/W2064314060","https://openalex.org/W2083681515","https://openalex.org/W2118862812","https://openalex.org/W2121947440","https://openalex.org/W2160642098","https://openalex.org/W2165232124","https://openalex.org/W2165521059","https://openalex.org/W2165835468","https://openalex.org/W2562836854","https://openalex.org/W2774226891","https://openalex.org/W2779640815","https://openalex.org/W2793247444","https://openalex.org/W2807790166","https://openalex.org/W3120740533","https://openalex.org/W4235169531","https://openalex.org/W4247105055","https://openalex.org/W4285719527","https://openalex.org/W6600399310","https://openalex.org/W6730713231"],"related_works":["https://openalex.org/W2999480577","https://openalex.org/W4312865573","https://openalex.org/W2360225591","https://openalex.org/W3174008170","https://openalex.org/W2043825057","https://openalex.org/W2901438737","https://openalex.org/W4289285285","https://openalex.org/W4220814143","https://openalex.org/W1482898105","https://openalex.org/W1984366963"],"abstract_inverted_index":{"Existing":[0],"clustering":[1,66,84,145,243],"algorithms":[2,67,85],"aim":[3],"at":[4],"identifying":[5,72],"clusters":[6,45,60,75,89,157,207],"from":[7,47],"a":[8,15,48,141,182,185,219],"single":[9,213],"dataset.":[10],"However,":[11],"many":[12,27],"applications":[13],"generate":[14],"series":[16,220],"of":[17,51,59,116,205,221],"datasets.":[18],"For":[19],"example,":[20],"scientists":[21],"need":[22,42],"to":[23,29,43,130,174,197],"repeat":[24],"an":[25,56],"experiment":[26],"times":[28],"ensure":[30],"reproducibility;":[31],"sensors":[32],"collect":[33],"information":[34],"day":[35],"after":[36],"day.":[37],"In":[38],"such":[39],"scenarios,":[40],"we":[41,139,155],"identify":[44,156],"separately":[46],"large":[49],"number":[50,58,79],"datasets,":[52,122],"which":[53,134,147,163],"can":[54,217],"contain":[55],"unknown":[57],"with":[61,223],"various":[62],"densities":[63],"and":[64,191,216,232],"shapes.Density-based":[65],"are":[68,86,90,100,109,164,195],"commonly":[69],"used":[70,196],"in":[71,208],"arbitrary":[73,209],"shaped":[74],"when":[76],"the":[77,113,151,160,168,175,179,212],"cluster":[78,104,186],"is":[80,118,128,135,184,203],"unknown.":[81],"Most":[82],"density-based":[83,144],"\"DBSCAN-alike\",":[87],"where":[88],"formed":[91],"by":[92,158],"connecting":[93],"consecutive":[94],"high":[95],"dense":[96],"regions.":[97],"Therefore,":[98],"points":[99,117,172],"grouped":[101],"as":[102,105,107],"one":[103],"long":[106],"they":[108],"densely":[110],"connected.":[111],"When":[112],"distribution":[114],"shape":[115],"changed":[119],"across":[120],"different":[121],"parameter":[123,214,225],"tuning":[124,226],"on":[125,229],"each":[126],"dataset":[127],"necessary":[129],"obtain":[131],"proper":[132],"results,":[133],"time-consuming.In":[136],"this":[137],"work,":[138],"developed":[140],"new":[142],"kNN":[143,189,242],"algorithm,":[146],"does":[148],"not":[149],"adopt":[150],"DBSCAN":[152],"paradigm.":[153],"Instead,":[154],"maximizing":[159],"intra-cluster":[161],"similarities,":[162],"estimated":[165],"using:":[166],"1)":[167],"probability":[169,180],"that":[170,181,236],"two":[171],"belong":[173],"same":[176],"cluster;":[177],"2)":[178],"point":[183],"center.":[187],"The":[188],"concept":[190],"minimum":[192],"spanning":[193],"tree":[194],"compute":[198],"both":[199,230],"probabilities.":[200],"Our":[201],"approach":[202,238],"capable":[204],"extracting":[206],"shapes":[210],"using":[211],"k,":[215],"handle":[218],"datasets":[222,234],"less":[224],"effort.":[227],"Experiments":[228],"synthetic":[231],"real-world":[233],"show":[235],"our":[237],"outperforms":[239],"other":[240],"recent":[241],"algorithms.":[244]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}