{"id":"https://openalex.org/W4378804430","doi":"https://doi.org/10.1145/3592686.3592706","title":"K-means Clustering Algorithm based on Improved Density Peak","display_name":"K-means Clustering Algorithm based on Improved Density Peak","publication_year":2023,"publication_date":"2023-02-10","ids":{"openalex":"https://openalex.org/W4378804430","doi":"https://doi.org/10.1145/3592686.3592706"},"language":"en","primary_location":{"id":"doi:10.1145/3592686.3592706","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1145/3592686.3592706","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 3rd International Conference on Bioinformatics and Intelligent Computing","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/A5090451391","display_name":"Debin Wei","orcid":"https://orcid.org/0000-0002-8950-5341"},"institutions":[{"id":"https://openalex.org/I4210092944","display_name":"Dalian University","ror":"https://ror.org/00g2ypp58","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210092944"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Debin Wei","raw_affiliation_strings":["Key Laboratory of Communication and Network, Dalian University, China"],"raw_orcid":"https://orcid.org/0000-0002-8950-5341","affiliations":[{"raw_affiliation_string":"Key Laboratory of Communication and Network, Dalian University, China","institution_ids":["https://openalex.org/I4210092944"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103265653","display_name":"Zhenxing Zhang","orcid":"https://orcid.org/0009-0000-6114-0400"},"institutions":[{"id":"https://openalex.org/I4210092944","display_name":"Dalian University","ror":"https://ror.org/00g2ypp58","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210092944"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhenxing Zhang","raw_affiliation_strings":["Key Laboratory of Communication and Network, Dalian University, China"],"raw_orcid":"https://orcid.org/0009-0000-6114-0400","affiliations":[{"raw_affiliation_string":"Key Laboratory of Communication and Network, Dalian University, China","institution_ids":["https://openalex.org/I4210092944"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090451391"],"corresponding_institution_ids":["https://openalex.org/I4210092944"],"apc_list":null,"apc_paid":null,"fwci":0.3802,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.72281628,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"30","issue":null,"first_page":"105","last_page":"109"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11980","display_name":"Human Mobility and Location-Based Analysis","score":0.9358999729156494,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"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/T11980","display_name":"Human Mobility and Location-Based Analysis","score":0.9358999729156494,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9337999820709229,"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/cluster-analysis","display_name":"Cluster analysis","score":0.8668246269226074},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.6195229887962341},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5728434324264526},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.5413439869880676},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.5229195356369019},{"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.5091153979301453},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.481723815202713},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47082263231277466},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47070905566215515},{"id":"https://openalex.org/keywords/data-stream-clustering","display_name":"Data stream clustering","score":0.4543355107307434},{"id":"https://openalex.org/keywords/k-medians-clustering","display_name":"k-medians clustering","score":0.4470512270927429},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4145090579986572},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3515716791152954},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2369394600391388},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.16158699989318848}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8668246269226074},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.6195229887962341},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5728434324264526},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.5413439869880676},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.5229195356369019},{"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.5091153979301453},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.481723815202713},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47082263231277466},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47070905566215515},{"id":"https://openalex.org/C193143536","wikidata":"https://www.wikidata.org/wiki/Q5227360","display_name":"Data stream clustering","level":5,"score":0.4543355107307434},{"id":"https://openalex.org/C115328559","wikidata":"https://www.wikidata.org/wiki/Q4041956","display_name":"k-medians clustering","level":5,"score":0.4470512270927429},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4145090579986572},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3515716791152954},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2369394600391388},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.16158699989318848},{"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.1145/3592686.3592706","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1145/3592686.3592706","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 3rd International Conference on Bioinformatics and Intelligent Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W2171098181","https://openalex.org/W2340057584","https://openalex.org/W2463477646","https://openalex.org/W2592377938","https://openalex.org/W2900089459","https://openalex.org/W2947117799","https://openalex.org/W3004688128","https://openalex.org/W3033217141","https://openalex.org/W3132028006","https://openalex.org/W3183630498","https://openalex.org/W3215175367","https://openalex.org/W4200014273","https://openalex.org/W4238811432"],"related_works":["https://openalex.org/W2559422900","https://openalex.org/W2892323093","https://openalex.org/W2393816671","https://openalex.org/W2188840951","https://openalex.org/W4384026335","https://openalex.org/W4241252752","https://openalex.org/W2739715168","https://openalex.org/W4292434959","https://openalex.org/W2794209582","https://openalex.org/W2380554135"],"abstract_inverted_index":{"Although":[0],"K-means":[1,36,131],"algorithm":[2,38,50,65,113,140],"is":[3,44,75],"simple":[4],"and":[5,9,28,90,106,171],"efficient,":[6],"the":[7,56,63,68,71,79,88,94,99,109,112,116,120,125,129,133,139,151,161,172],"number":[8,89],"location":[10,91],"information":[11,92],"of":[12,59,93,111,135,138],"its":[13],"initial":[14,95],"clustering":[15,26,37,84,96,152],"centers":[16,97],"are":[17],"usually":[18],"determined":[19],"by":[20,78,147,157,167,178],"subjective":[21],"experience,":[22],"resulting":[23],"in":[24,62,124,141],"unstable":[25],"effect":[27],"certain":[29],"randomness.":[30],"To":[31],"solve":[32,67],"this":[33,142],"problem,":[34],"a":[35],"based":[39,114],"on":[40,115,149,159,169,180],"improved":[41,47,83,100],"density":[42,48,58,74,101],"peaks":[43],"proposed.":[45],"The":[46,82],"peak":[49,102],"uses":[51],"data":[52,60,121],"field":[53],"to":[54,66],"replace":[55],"local":[57,73],"points":[61],"original":[64,72],"limitation":[69],"that":[70],"easily":[76],"affected":[77],"truncation":[80],"distance.":[81],"algo-rithm":[85],"first":[86],"obtains":[87],"through":[98],"algorithm,":[103,132],"then":[104],"clusters,":[105],"finally":[107],"verifies":[108],"effectiveness":[110],"UCI":[117],"dataset.":[118],"In":[119],"set":[122],"selected":[123],"experiment,":[126],"compared":[127],"with":[128],"traditional":[130],"sum":[134],"error":[136],"squares":[137],"paper":[143],"has":[144,154,164,175],"been":[145,155,165,176],"reduced":[146],"10.32%":[148],"average,":[150,160,170],"accuracy":[153],"increased":[156,166,177],"5.28%":[158],"Rand":[162],"index":[163,174],"5.25%":[168],"Jaccard":[173],"14.86%":[179],"average.":[181]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-12-21T23:12:01.093139","created_date":"2025-10-10T00:00:00"}