{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:18:36Z","timestamp":1740133116021,"version":"3.37.3"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-16-3-0001"],"award-info":[{"award-number":["W911NF-16-3-0001"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"name":"U.K. Ministry of Defence","award":["W911NF-16-3-0001"],"award-info":[{"award-number":["W911NF-16-3-0001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tpds.2022.3144595","type":"journal-article","created":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T20:44:23Z","timestamp":1643057063000},"page":"1-1","source":"Crossref","is-referenced-by-count":0,"title":["Communication-efficient k-Means for Edge-based Machine Learning"],"prefix":"10.1109","author":[{"given":"Hanlin","family":"Lu","sequence":"first","affiliation":[]},{"given":"Ting","family":"He","sequence":"additional","affiliation":[]},{"given":"Shiqiang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Changchang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Mehrdad","family":"Mahdavi","sequence":"additional","affiliation":[]},{"given":"Vijaykrishnan","family":"Narayanan","sequence":"additional","affiliation":[]},{"given":"Kevin S.","family":"Chan","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Pasteris","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"article-title":"The MNIST database of handwritten digits","year":"1998","author":"lecun","key":"ref39"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1741"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00025-4"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"journal-title":"Generalized Inverses Theory and Applications","year":"2003","author":"ben-israel","key":"ref31"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"1372","DOI":"10.1109\/TKDE.2008.222","article-title":"Approximate distributed k-means clustering over a peer-to-peer network","volume":"21","author":"giannella","year":"2009","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/76359.76371"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_2"},{"article-title":"Improved distributed principal component analysis","year":"2014","author":"balcan","key":"ref35"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfa.2004.10.009"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316350"},{"key":"ref40","article-title":"Poisson random fields for dynamic feature models","volume":"18","author":"perrone","year":"0","journal-title":"J Mach Learn Res"},{"article-title":"Turning big data into tiny data: Constant-size coresets for k-means, PCA, and projective clustering","year":"2018","author":"feldman","key":"ref11"},{"journal-title":"Introduction to Data Compression Fourth Edition","year":"2012","author":"sayood","key":"ref12"},{"journal-title":"Vector Quantization and Signal Compression","year":"2012","author":"gersho","key":"ref13"},{"key":"ref14","first-page":"298","article-title":"Random projections for k-means clustering","author":"boutsidis","year":"2010","journal-title":"Proc 23rd Int Conf Neural Inf Process Syst"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746569"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000033113.59016.96"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2375327"},{"key":"ref18","first-page":"189","article-title":"Extensions of Lipschitz mappings into a Hilbert space","author":"johnson","year":"1982","journal-title":"Proc Conf Modern Anal Probability"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007400"},{"key":"ref28","first-page":"387","article-title":"An optimal distributed k-means clustering algorithm based on CloudStack","author":"mao","year":"2015","journal-title":"Proc Int Conf Front Comput Sci Technol"},{"key":"ref4","first-page":"1995","article-title":"Distributed k-means and k-median clustering on general topologies","author":"balcan","year":"2013","journal-title":"Proc 26th Int Conf Neural Inf Process Syst"},{"key":"ref27","first-page":"3113","article-title":"Improved distributed principal component analysis","author":"balcan","year":"2014","journal-title":"Proc 27th Int Conf Neural Inf Process Syst"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2904348"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3000373"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/BRACIS.2013.20"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM38437.2019.9013625"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5103-0"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2019.2941458"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.05.034"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS47774.2020.00062"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060622"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/070699007"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-006-1271-x"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_2"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993712"},{"key":"ref41","first-page":"1","article-title":"IEEE standard for floating-point arithmetic","year":"2019","journal-title":"IEEE Std 754-2019 (Revision of IEEE 754-2008)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.50"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974348.39"},{"article-title":"New frameworks for offline and streaming coreset constructions","year":"2016","author":"braverman","key":"ref25"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/4359390\/09690512.pdf?arnumber=9690512","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T14:43:34Z","timestamp":1649169814000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9690512\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/tpds.2022.3144595","relation":{},"ISSN":["1045-9219","1558-2183","2161-9883"],"issn-type":[{"type":"print","value":"1045-9219"},{"type":"electronic","value":"1558-2183"},{"type":"electronic","value":"2161-9883"}],"subject":[],"published":{"date-parts":[[2022]]}}}