{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:21:31Z","timestamp":1768281691222,"version":"3.49.0"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/access.2025.3649210","type":"journal-article","created":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T18:39:29Z","timestamp":1767033569000},"page":"1758-1779","source":"Crossref","is-referenced-by-count":0,"title":["M\n                    <i>k<\/i>\n                    -Means: Improving Partition-Based Clustering With Optimized Centroid Initialization"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2564-426X","authenticated-orcid":false,"given":"Rosy","family":"Sarmah","sequence":"first","affiliation":[{"name":"Department of CSE, Tezpur University, Tezpur, Assam, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0182-156X","authenticated-orcid":false,"given":"Rabinder","family":"Kumar Prasad","sequence":"additional","affiliation":[{"name":"Department of CSE, DUIET, Dibrugarh University, Dibrugarh, Assam, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5819-4149","authenticated-orcid":false,"given":"Moirangthem","family":"Tiken Singh","sequence":"additional","affiliation":[{"name":"Department of CSE, DUIET, Dibrugarh University, Dibrugarh, Assam, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sauravjyoti","family":"Sarmah","sequence":"additional","affiliation":[{"name":"Department of CSE, Jorhat Engineering College, Jorhat, Assam, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6141-0191","authenticated-orcid":false,"given":"Abhijit","family":"Boruah","sequence":"additional","affiliation":[{"name":"Department of CSE, DUIET, Dibrugarh University, Dibrugarh, Assam, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1748-8685","authenticated-orcid":false,"given":"Sudipta","family":"Majumder","sequence":"additional","affiliation":[{"name":"Department of CSE, DUIET, Dibrugarh University, Dibrugarh, Assam, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-4308-0343","authenticated-orcid":false,"given":"Minhazur","family":"Rahman","sequence":"additional","affiliation":[{"name":"Department of CSE, Tezpur University, Tezpur, Assam, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.09.050"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2020.100284"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1166\/rits.2016.1055"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120250"},{"key":"ref5","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","volume-title":"Proc. 5th Berkeley Symp. Math. Statist. Probab.","volume":"1","author":"MacQueen"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316801.ch2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316801"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1033770"},{"key":"ref9","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","author":"Ester","year":"1996","journal-title":"KDD"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37456-2_14"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/304181.304187"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.09.054"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34869-4_5"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.11.139"},{"key":"ref15","first-page":"1027","article-title":"K-means++ the advantages of careful seeding","volume-title":"Proc. 18th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Arthur"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9414687"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.3389\/frai.2021.740817"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2023.110036"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0098-3004(84)90020-7"},{"key":"ref20","first-page":"91","article-title":"Refining initial points for K-means clustering","volume-title":"Proc. ICML","volume":"98","author":"Bradley"},{"key":"ref21","first-page":"428","article-title":"A comparison of document clustering techniques","volume-title":"Proc. TextMining Workshop KDD","author":"Steinbach"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(02)00060-2"},{"key":"ref23","first-page":"727","article-title":"X-means: Extending K-means with efficient estimation of the number of clusters","volume-title":"Proc. Icml","author":"Pelleg"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02490-0_69"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2018.08.028"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICBDA.2018.8367720"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2018.02.015"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106672"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-021-09028-4"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3155450"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118656"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s41066-024-00470-w"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-024-05636-2"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2023.3234227"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2025.111548"},{"key":"ref36","first-page":"585","article-title":"Convergence properties of the K-means algorithms","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"7","author":"Bottou"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1238-7"},{"key":"ref38","volume-title":"The UCI Machine Learning Repository","author":"Kelly","year":"2023"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/BF01908075"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553511"},{"issue":"1","key":"ref41","first-page":"27","article-title":"Internal versus external cluster validation indexes","volume":"5","author":"Rend\u00f3n","year":"2011","journal-title":"Int. J. Comput. Commun."},{"key":"ref42","first-page":"100","article-title":"A K-means clustering algorithm","volume":"28","author":"Ja","year":"1979","journal-title":"JR Stat. Soc. Ser. C-Appl. Stat."}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/11323511\/11318004.pdf?arnumber=11318004","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T22:02:38Z","timestamp":1768255358000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11318004\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3649210","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}