{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:17:19Z","timestamp":1761581839024,"version":"3.37.3"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1731126"],"award-info":[{"award-number":["U1731126"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shanxi Province Key Research and Development Program","award":["201803D121059"],"award-info":[{"award-number":["201803D121059"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2921320","type":"journal-article","created":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T16:09:31Z","timestamp":1559837371000},"page":"74683-74693","source":"Crossref","is-referenced-by-count":34,"title":["A Novel Algorithm for Initial Cluster Center Selection"],"prefix":"10.1109","volume":"7","author":[{"given":"Yating","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6945-8093","authenticated-orcid":false,"given":"Jianghui","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Haifeng","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Jifu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xujun","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1007\/978-1-4757-0450-1"},{"key":"ref11","first-page":"1027","article-title":"K-Means++: The advantages of careful seeding","author":"arthur","year":"2007","journal-title":"Proc 18th Annu ACM-SIAM Symp Discrete Algorithms"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/ICIT.2016.7475096"},{"key":"ref13","first-page":"537","article-title":"An effificient improved K-means clustering algorithm","volume":"42","author":"zhang","year":"2014","journal-title":"Journal of Fuzhou University"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.eswa.2016.10.022","article-title":"Distance and density based clustering algorithm using Gaussian kernel","volume":"69","author":"g\u00fcng\u00f6r","year":"2017","journal-title":"Expert Syst Appl"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1016\/j.camwa.2009.04.017"},{"key":"ref16","first-page":"1385","article-title":"An efficient k’-means clustering algorithm","volume":"29","author":"\u017ealik","year":"2008","journal-title":"Elsevier Science Inc"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1088\/1755-1315\/58\/1\/012059"},{"key":"ref18","first-page":"48","article-title":"Improved K-means algorithm based on global center and nonuniqueness high-density points","volume":"52","author":"yunbin","year":"2016","journal-title":"Comput Eng Appl"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1016\/j.patrec.2011.07.011"},{"key":"ref4","first-page":"41","article-title":"Review on clustering algorithms","volume":"6","author":"chen","year":"2017","journal-title":"Integration Technology"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1007\/978-3-642-37453-1_21"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1016\/j.asoc.2017.04.031"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1016\/j.eswa.2017.09.052"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1126\/science.1242072"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1016\/j.asoc.2018.07.026"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/TKDE.2012.32"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref9","first-page":"230","article-title":"K-medoids clustering algorithms with optimized initial seeds by density peaks","volume":"10","author":"juanying","year":"2016","journal-title":"Journal of Frontiers of Computer Science and Technology"},{"key":"ref20","first-page":"97","article-title":"Optimization study on k value of K-means algorithm","volume":"2","author":"shan-lin","year":"2006","journal-title":"Systems Engineering - Theory & Practice"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1088\/1674-4527\/15\/8\/002"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1093\/mnras\/sts443"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1086\/192087","article-title":"Old stellar populations. 5. Absorption feature indices for the complete LICK\/IDS sample of stars","volume":"94","author":"worthey","year":"2007","journal-title":"Astrophys J"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1088\/1674-4527\/12\/9\/003"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08732318.pdf?arnumber=8732318","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:54:35Z","timestamp":1641988475000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8732318\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2921320","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}