{"id":"https://openalex.org/W3210928138","doi":"https://doi.org/10.3233/faia210218","title":"An Optimized Clustering Algorithm for Contour Data","display_name":"An Optimized Clustering Algorithm for Contour Data","publication_year":2021,"publication_date":"2021-10-14","ids":{"openalex":"https://openalex.org/W3210928138","doi":"https://doi.org/10.3233/faia210218","mag":"3210928138"},"language":"en","primary_location":{"id":"doi:10.3233/faia210218","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia210218","pdf_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA210218","source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA210218","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063715901","display_name":"Yucheng Chu","orcid":null},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yucheng Chu","raw_affiliation_strings":["School of Information Science and Engineering, Yunnan University, Kunming 650500, China","School of Information Science and Engineering, Yunnan University, Kunming 650500, China;"],"affiliations":[{"raw_affiliation_string":"School of Information Science and Engineering, Yunnan University, Kunming 650500, China","institution_ids":["https://openalex.org/I189210763"]},{"raw_affiliation_string":"School of Information Science and Engineering, Yunnan University, Kunming 650500, China;","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100669732","display_name":"Lizhen Wang","orcid":"https://orcid.org/0000-0003-2214-2299"},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lizhen Wang","raw_affiliation_strings":["School of Information Science and Engineering, Yunnan University, Kunming 650500, China","School of Information Science and Engineering, Yunnan University, Kunming 650500, China;"],"affiliations":[{"raw_affiliation_string":"School of Information Science and Engineering, Yunnan University, Kunming 650500, China","institution_ids":["https://openalex.org/I189210763"]},{"raw_affiliation_string":"School of Information Science and Engineering, Yunnan University, Kunming 650500, China;","institution_ids":["https://openalex.org/I189210763"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5063715901"],"corresponding_institution_ids":["https://openalex.org/I189210763"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27404329,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T13731","display_name":"Advanced Computing and Algorithms","score":0.802299976348877,"subfield":{"id":"https://openalex.org/subfields/3322","display_name":"Urban Studies"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T13731","display_name":"Advanced Computing and Algorithms","score":0.802299976348877,"subfield":{"id":"https://openalex.org/subfields/3322","display_name":"Urban Studies"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T14139","display_name":"E-commerce and Technology Innovations","score":0.7214000225067139,"subfield":{"id":"https://openalex.org/subfields/1403","display_name":"Business and International Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.8562079668045044},{"id":"https://openalex.org/keywords/k-medians-clustering","display_name":"k-medians clustering","score":0.5279293060302734},{"id":"https://openalex.org/keywords/single-linkage-clustering","display_name":"Single-linkage clustering","score":0.4980742931365967},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.49392396211624146},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4876369535923004},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4836041033267975},{"id":"https://openalex.org/keywords/data-point","display_name":"Data point","score":0.48305565118789673},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.47512370347976685},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.4704540967941284},{"id":"https://openalex.org/keywords/data-set","display_name":"Data set","score":0.45218485593795776},{"id":"https://openalex.org/keywords/complete-linkage-clustering","display_name":"Complete-linkage clustering","score":0.4488902986049652},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.4393078088760376},{"id":"https://openalex.org/keywords/clustering-high-dimensional-data","display_name":"Clustering high-dimensional data","score":0.4376071095466614},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4347769618034363},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.42725878953933716},{"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.4170811176300049},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40015244483947754},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.36212751269340515},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07502317428588867}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8562079668045044},{"id":"https://openalex.org/C115328559","wikidata":"https://www.wikidata.org/wiki/Q4041956","display_name":"k-medians clustering","level":5,"score":0.5279293060302734},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.4980742931365967},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.49392396211624146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4876369535923004},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4836041033267975},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.48305565118789673},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.47512370347976685},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.4704540967941284},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.45218485593795776},{"id":"https://openalex.org/C23822008","wikidata":"https://www.wikidata.org/wiki/Q5156437","display_name":"Complete-linkage clustering","level":5,"score":0.4488902986049652},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.4393078088760376},{"id":"https://openalex.org/C184509293","wikidata":"https://www.wikidata.org/wiki/Q5136711","display_name":"Clustering high-dimensional data","level":3,"score":0.4376071095466614},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4347769618034363},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.42725878953933716},{"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.4170811176300049},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40015244483947754},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.36212751269340515},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07502317428588867},{"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.3233/faia210218","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia210218","pdf_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA210218","source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.3233/faia210218","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia210218","pdf_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA210218","source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3210928138.pdf","grobid_xml":"https://content.openalex.org/works/W3210928138.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2229552629","https://openalex.org/W2188840951","https://openalex.org/W2263992973","https://openalex.org/W2338192130","https://openalex.org/W2308893070","https://openalex.org/W1481928625","https://openalex.org/W4232307982","https://openalex.org/W2598125667","https://openalex.org/W3092684173","https://openalex.org/W2939532692"],"abstract_inverted_index":{"The":[0,29,49,184,290,311],"initial":[1,80,106,141,249,259,291],"center\u2019s":[2],"selection":[3],"of":[4,26,58,72,83,94,113,130,153,170,231,234,239,244,318],"the":[5,13,24,32,37,41,47,55,59,79,84,92,100,111,114,118,150,157,160,163,168,171,181,188,194,201,204,208,212,216,229,232,237,242,248,253,263,272,276,279,283,298,315],"traditional":[6],"K-means":[7,62,273],"algorithm":[8,14,63,129,137,158,185,285,313],"is":[9,44,53,65,134,228,267,294],"random.":[10],"It":[11],"makes":[12],"instability.":[15],"Traditional":[16],"clustering":[17,25,81,107,133,151,265,292,299,316],"methods":[18],"are":[19],"hard":[20],"to":[21,23,68,77,90,122,148,180,193,207,210,224,236,256,271],"apply":[22],"contour":[27,33,38,85,95,131,144,154,319],"data.":[28,155],"data":[30,34,73,96,132,217,281,320],"from":[31],"set":[35,218],"forms":[36],"shape,":[39],"but":[40],"cluster":[42,51,250,260],"center":[43,52,57,82,293],"not":[45,66,178],"on":[46,99,167,278],"contour.":[48,60],"final":[50,264],"in":[54,88],"inner":[56],"Using":[61],"directly":[64],"able":[67],"handle":[69],"this":[70,126],"kind":[71],"well.":[74,321],"In":[75,125],"order":[76,89],"optimize":[78],"data,":[86,145],"and":[87,305],"solve":[91],"problem":[93,317],"clustering.":[97,124],"Based":[98],"high":[101,303],"density":[102],"area":[103],"may":[104],"be":[105],"centers.":[108,261],"And":[109,165,297],"under":[110],"thought":[112],"farther":[115],"apart":[116],"distance":[117,161],"more":[119],"likely":[120],"belonged":[121],"different":[123],"paper,":[127],"an":[128],"proposed.":[135],"This":[136],"can":[138],"obtain":[139],"better":[140],"central":[142],"for":[143],"so":[146],"as":[147,200,247],"improve":[149],"effect":[152],"Firstly,":[156],"calculates":[159],"between":[162],"samples.":[164],"based":[166],"premise":[169],"two":[172,190],"farthest":[173,189],"points":[174,191,246],"most":[175],"probability":[176],"does":[177],"belong":[179],"same":[182],"class.":[183],"finds":[186],"out":[187,269],"according":[192,270],"sample":[195],"distance.":[196],"With":[197],"one":[198],"point":[199,205,209,213],"center,":[202],"find":[203],"closest":[206],"join":[211],"set.":[214],"Until":[215],"number":[219,226,233,238],"greater":[220],"than":[221],"or":[222],"equal":[223],"\u03b1":[225],"(\u03b1":[227],"ratio":[230],"samples":[235],"clusters).":[240],"Calculate":[241],"average":[243],"all":[245],"center.":[251],"Repeat":[252],"above":[254],"steps":[255],"get":[257],"K":[258],"Then":[262],"calculation":[266],"carried":[268],"algorithm.":[274],"After":[275],"experiment":[277],"experimental":[280],"set,":[282],"improved":[284,312],"has":[286],"a":[287,302,307],"strong":[288],"stability.":[289],"uniformly":[295],"discrete.":[296],"results":[300],"have":[301,306],"accuracy":[304],"good":[308],"F1":[309],"value.":[310],"solves":[314]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}