{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T03:05:44Z","timestamp":1779246344327,"version":"3.51.4"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1109\/cidm.2009.4938630","type":"proceedings-article","created":{"date-parts":[[2009,5,19]],"date-time":"2009-05-19T15:53:08Z","timestamp":1242748388000},"page":"61-68","source":"Crossref","is-referenced-by-count":32,"title":["A pillar algorithm for K-means optimization by distance maximization for initial centroid designation"],"prefix":"10.1109","author":[{"given":"Ali Ridho","family":"Barakbah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasushi","family":"Kiyoki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/CIDM.2009.4938630"},{"key":"18","year":"0"},{"key":"15","first-page":"286","article-title":"optimization of initial centroids for k-means using simulated annealing","author":"barakbah","year":"2005","journal-title":"Proc Industrial Electronics Seminar (IES) 2005"},{"key":"16","first-page":"240","article-title":"a new algorithm for optimization of k-means clustering with determining maximum distance between centroids","author":"barakbah","year":"2006","journal-title":"Proc Industrial Electronics Seminar (IES) 2006"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2004.04.007"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/CIDM.2009.4938630"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(03)00146-6"},{"key":"12","article-title":"identifying moving variance to make automatic clustering for normal dataset","author":"barakbah","year":"2004","journal-title":"Proc IECI Japan Workshop 2004 (IJW 2004)"},{"key":"3","article-title":"refining initial points for k-means clustering","author":"bradley","year":"1998","journal-title":"Proc 15th Internat Conf on Machine Learning (ICML'98)"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(95)00075-R"},{"key":"1","author":"yi-tsuu","year":"1978","journal-title":"Interactive Pattern Recognition"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/568574.568575"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(01)00021-6"},{"key":"6","first-page":"137","article-title":"determination of number of clusters in k-means clustering and application in colthe image segmentation","author":"ray","year":"1999","journal-title":"Proc 4th ICAPRDT"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(99)00069-0"},{"key":"4","author":"growe","year":"1999","journal-title":"Comparing Algorithms and Clustering Data Components of The Data Mining Process"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2002.1033218"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/SSDM.2001.938534"}],"event":{"name":"2009 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","location":"Nashville, TN, USA","start":{"date-parts":[[2009,3,30]]},"end":{"date-parts":[[2009,4,2]]}},"container-title":["2009 IEEE Symposium on Computational Intelligence and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4910529\/4938616\/04938630.pdf?arnumber=4938630","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T16:33:52Z","timestamp":1489768432000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4938630\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/cidm.2009.4938630","relation":{},"subject":[],"published":{"date-parts":[[2009,3]]}}}