{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:29:56Z","timestamp":1750181396755,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"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":[],"published-print":{"date-parts":[[2022,12,17]]},"DOI":"10.1109\/bigdata55660.2022.10020427","type":"proceedings-article","created":{"date-parts":[[2023,1,26]],"date-time":"2023-01-26T19:35:23Z","timestamp":1674761723000},"page":"194-200","source":"Crossref","is-referenced-by-count":1,"title":["Enhancing k-Means Algorithm with Tensor Processing Unit"],"prefix":"10.1109","author":[{"given":"Pranava","family":"Mummoju","sequence":"first","affiliation":[{"name":"University of Vienna,Faculty of Computer Science,Vienna,Austria"}]},{"given":"Anna","family":"Wolff","sequence":"additional","affiliation":[{"name":"University of Vienna,Faculty of Computer Science,Vienna,Austria"}]},{"given":"Martin","family":"Perdacher","sequence":"additional","affiliation":[{"name":"University of Vienna,Faculty of Computer Science,Vienna,Austria"}]},{"given":"Claudia","family":"Plant","sequence":"additional","affiliation":[{"name":"ds:Univie University of Vienna,Faculty of Computer Science,Vienna,Austria"}]},{"given":"Christian","family":"Bohm","sequence":"additional","affiliation":[{"name":"University of Vienna,Faculty of Computer Science,Vienna,Austria"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-81-322-3972-7_17"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2018.032271057"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3079856.3080246"},{"volume-title":"System Architecture \u2014 Cloud TPU","key":"ref4"},{"volume-title":"Cloud Tensor Processing Units (TPUs) \u2014 Google Cloud","key":"ref5"},{"key":"ref6","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","volume-title":"5-Th Berkeley Symposium on Mathematical Statistics and Probability","author":"MacQueen"},{"issue":"3","key":"ref7","first-page":"768","article-title":"Cluster analysis of multivariate data: Efficiency vs. interpretability of classification","volume":"21","author":"Forgy","year":"1965","journal-title":"Biometrics. Journal of the International Biometric Society"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"volume-title":"Clustering Algorithms","year":"1975","author":"Hartigan","key":"ref9"},{"volume-title":"Algorithms for Clustering Data","year":"1988","author":"Jain","key":"ref10"},{"volume-title":"Data Mining: Concepts and Techniques. The Morgan Kaufmann Series in Data Management Systems","year":"2012","author":"Han","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2015.85"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-014-1185-y"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3080821"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974973.31"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46502-2_13"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INTENSIVE.2009.19"},{"key":"ref18","first-page":"727","article-title":"X-means:Extending k-means with efficient estimation of the number of clusters","volume":"1","author":"Pelleg","year":"2000","journal-title":"Icml"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2988796"},{"key":"ref20","first-page":"281","article-title":"Learning the k in k-means","volume":"16","author":"Hamerly","year":"2003","journal-title":"Advances in neural information processing systems"},{"key":"ref21","article-title":"k-means++: The advantages of careful seeding","volume-title":"Technical Report 2006-13","author":"Arthur","year":"2006"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/2180912.2180915"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/s0031-3203(02)00060-2"},{"key":"ref24","article-title":"A Comparison of Document Clustering Techniques","volume-title":"Report","author":"Steinbach","year":"2000"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0114-2"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/359576.359579"},{"volume-title":"UCI Machine Learning Repository: Bank Marketing Data Set","key":"ref27"}],"event":{"name":"2022 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2022,12,17]]},"location":"Osaka, Japan","end":{"date-parts":[[2022,12,20]]}},"container-title":["2022 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10020192\/10020156\/10020427.pdf?arnumber=10020427","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T05:59:53Z","timestamp":1707803993000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10020427\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,17]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/bigdata55660.2022.10020427","relation":{},"subject":[],"published":{"date-parts":[[2022,12,17]]}}}