{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T22:40:48Z","timestamp":1760740848094,"version":"build-2065373602"},"publisher-location":"Singapore","reference-count":11,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819534616"},{"type":"electronic","value":"9789819534623"}],"license":[{"start":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:00:00Z","timestamp":1760659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:00:00Z","timestamp":1760659200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-3462-3_15","type":"book-chapter","created":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T17:15:48Z","timestamp":1760634948000},"page":"203-212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["IO-K-Means: Iterative Optimization for\u00a0Centroids in\u00a0K-Means"],"prefix":"10.1007","author":[{"given":"Shuntai","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiayao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yishu","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Pang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yizhang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,17]]},"reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.7763\/JACN.2013.V1.28","volume":"1","author":"A Alrabea","year":"2013","unstructured":"Alrabea, A., Senthilkumar, A., Al-Shalabi, H., Bader, A.: Enhancing K-means algorithm with initial cluster centers derived from data partitioning along the data axis with PCA. J. Adv. Comput. Netw. 1(2), 137\u2013142 (2013)","journal-title":"J. Adv. Comput. Netw."},{"key":"15_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118656","volume":"211","author":"M Ay","year":"2023","unstructured":"Ay, M., \u00d6zbak\u0131r, L., Kulluk, S., G\u00fclmez, B., \u00d6zt\u00fcrk, G., \u00d6zer, S.: FC-Kmeans: fixed-centered K-means algorithm. Expert Syst. Appl. 211, 118656 (2023)","journal-title":"Expert Syst. Appl."},{"key":"15_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118862","volume":"212","author":"TK Biswas","year":"2023","unstructured":"Biswas, T.K., Giri, K., Roy, S.: ECKM: an improved k-means clustering based on computational geometry. Expert Syst. Appl. 212, 118862 (2023)","journal-title":"Expert Syst. Appl."},{"issue":"14","key":"15_CR4","doi-asserted-by":"publisher","first-page":"1701","DOI":"10.1016\/j.patrec.2011.07.011","volume":"32","author":"M Erisoglu","year":"2011","unstructured":"Erisoglu, M., Calis, N., Sakallioglu, S.: A new algorithm for initial cluster centers in K-means algorithm. Pattern Recogn. Lett. 32(14), 1701\u20131705 (2011)","journal-title":"Pattern Recogn. Lett."},{"key":"15_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2023.109404","volume":"139","author":"H Hu","year":"2023","unstructured":"Hu, H., Liu, J., Zhang, X., Fang, M.: An effective and adaptable K-means algorithm for big data cluster analysis. Pattern Recogn. 139, 109404 (2023)","journal-title":"Pattern Recogn."},{"issue":"4","key":"15_CR6","doi-asserted-by":"publisher","first-page":"3433","DOI":"10.1109\/TKDE.2022.3155450","volume":"35","author":"F Nie","year":"2022","unstructured":"Nie, F., Li, Z., Wang, R., Li, X.: An effective and efficient algorithm for K-means clustering with new formulation. IEEE Trans. Knowl. Data Eng. 35(4), 3433\u20133443 (2022)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"15_CR7","doi-asserted-by":"publisher","unstructured":"Nigro, L., Cicirelli, F.: Improving K-means by an agglomerative method and density peaks. In: Kumar, S., Sharma, H., Balachandran, K., Kim, J.H., Bansal, J.C. (eds.) CIS 2022. LNCS, vol. 608, pp. 343\u2013359. Springer, Singapore (2022). https:\/\/doi.org\/10.1007\/978-981-19-9225-4_26","DOI":"10.1007\/978-981-19-9225-4_26"},{"issue":"3","key":"15_CR8","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1007\/s12065-022-00720-3","volume":"16","author":"KK Pandey","year":"2023","unstructured":"Pandey, K.K., Shukla, D.: Min-max kurtosis mean distance based K-means initial centroid initialization method for big genomic data clustering. Evol. Intel. 16(3), 1055\u20131076 (2023)","journal-title":"Evol. Intel."},{"issue":"2","key":"15_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.12700\/APH.21.2.2024.2.6","volume":"21","author":"A \u015eenol","year":"2024","unstructured":"\u015eenol, A.: ImpKmeans: an improved version of the K-means algorithm, by determining optimum initial centroids, based on multivariate kernel density estimation and KD-tree. Acta Polytechnica Hungarica 21(2), 111\u2013131 (2024)","journal-title":"Acta Polytechnica Hungarica"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-007-0114-2","volume":"14","author":"X Wu","year":"2008","unstructured":"Wu, X., et al.: Top 10 algorithms in data mining. Knowl. Inf. Syst. 14, 1\u201337 (2008)","journal-title":"Knowl. Inf. Syst."},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Xu, H., Yao, S., Li, Q., Ye, Z.: An improved K-means clustering algorithm. In: IEEE 5th International Symposium on Smart and Wireless Systems Within the Conferences on Intelligent Data Acquisition and Advanced Computing Systems, pp.\u00a01\u20135. IEEE (2020)","DOI":"10.1109\/IDAACS-SWS50031.2020.9297060"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-3462-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T22:04:50Z","timestamp":1760738690000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-3462-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,17]]},"ISBN":["9789819534616","9789819534623"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-3462-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,17]]},"assertion":[{"value":"17 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adma2025.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}