{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T20:06:55Z","timestamp":1769285215921,"version":"3.49.0"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tkde.2020.3002926","type":"journal-article","created":{"date-parts":[[2020,6,16]],"date-time":"2020-06-16T21:30:16Z","timestamp":1592343016000},"page":"1-1","source":"Crossref","is-referenced-by-count":21,"title":["An efficient Split-Merge re-start for the K-means algorithm"],"prefix":"10.1109","author":[{"given":"Marco","family":"Capo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aritz","family":"Perez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose A. Antonio","family":"Lozano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Algorithms for Clustering Data","author":"Jain","year":"1988"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2002.1017616"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-28349-8_2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2008.2006641"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/3477.764879"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2008.2004559"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0114-2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5103-0"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00202-1_24"},{"key":"ref11","volume-title":"Clustering by Means of Medoids","author":"Kaufman","year":"1987"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref13","first-page":"585","article-title":"Convergence properties of the K-means algorithms","volume-title":"Proc. Advances Neural Inf. Process. Syst.","author":"Bottou"},{"key":"ref14","first-page":"147","article-title":"Using the triangle inequality to accelerate k-means","volume-title":"Proc. 20th Int. Conf. Mach. Learn.","author":"Elkan"},{"key":"ref15","first-page":"579","article-title":"Yinyang K-means: A drop-in replacement of the classic k-means with consistent speedup","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ding"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772862"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219973"},{"key":"ref18","first-page":"1995","article-title":"Distributed $ k$k-means and $ k$k-median clustering on general topologies","volume-title":"Proc. Advances Neural Inf. Process. Syst.","author":"Balcan"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.06.031"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-020-00678-9"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1247069.1247072"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007400"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.7"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/s0167-8655(99)00069-0"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-011-9340-1"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.07.021"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2019.04.014"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2007.01.001"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s00357-007-0003-0"},{"key":"ref30","first-page":"768","article-title":"Cluster analysis of multivariate data: Efficiency versus interpretability of classifications","volume":"21","author":"Forgy","year":"1965","journal-title":"Biometrics"},{"key":"ref31","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":"ref32","doi-asserted-by":"publisher","DOI":"10.14778\/2180912.2180915"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.2307\/2346830"},{"key":"ref35","article-title":"Further heuristics for $ k$k-means: The merge-and-split heuristic and the $(k, l)$(k,l)-means","author":"Nielsen","year":"2014"},{"key":"ref36","first-page":"820","article-title":"Hartigan\u2019s method: K-means clustering without voronoi","volume-title":"Proc. 13th Int. Conf. Artif. Intell. Statist.","author":"Telgarsky"},{"key":"ref37","first-page":"1677","article-title":"Hartigan\u2019s K-means versus lloyd\u2019s K-means-is it time for a change?","volume-title":"Proc. 23rd Int. Joint Conf. Artif. Intell.","author":"Slonim"},{"key":"ref38","first-page":"727","article-title":"X-means: Extending K-means with efficient estimation of the number of clusters","volume-title":"Proc. 17th Int. Conf. Mach. Learn.","author":"Pelleg"},{"key":"ref39","article-title":"Isodata, a novel method of data analysis and pattern classification","author":"Ball","year":"1965"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/29.35395"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1117\/1.601810"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1117\/1.1412423"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2002.1183895"},{"key":"ref44","first-page":"55","article-title":"Fast and provably good seedings for k-means","volume-title":"Proc. Advances Neural Inf. Process. Syst.","author":"Bachem"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/09119142.pdf?arnumber=9119142","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T22:39:55Z","timestamp":1704839995000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9119142\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/tkde.2020.3002926","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}