{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T09:19:22Z","timestamp":1790500762172,"version":"4.1.0"},"reference-count":37,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,1,10]],"date-time":"2021-01-10T00:00:00Z","timestamp":1610236800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,10]],"date-time":"2021-01-10T00:00:00Z","timestamp":1610236800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,10]],"date-time":"2021-01-10T00:00:00Z","timestamp":1610236800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001691","name":"JSPS","doi-asserted-by":"publisher","award":["JP16K00031,JP17H01732"],"award-info":[{"award-number":["JP16K00031,JP17H01732"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,1,10]]},"DOI":"10.1109\/icpr48806.2021.9412131","type":"proceedings-article","created":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T02:15:54Z","timestamp":1620267354000},"page":"1627-1634","source":"Crossref","is-referenced-by-count":7,"title":["Wasserstein k-means with sparse simplex projection"],"prefix":"10.1109","author":[{"given":"Takumi","family":"Fukunaga","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hiroyuki","family":"Kasai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026543900054"},{"key":"ref32","article-title":"Sinkhorn distances: Lightspeed computation of optimal transport","author":"cuturi","year":"0","journal-title":"Annual Conference on Neural Information Processing Systems (NIPS)"},{"key":"ref31","article-title":"On the computational complexity of finding a sparse wasserstein barycenter","author":"borgwardt","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref30","article-title":"Wasserstein k-means++ for cloud regime histogram clustering","author":"staib","year":"0","journal-title":"Proceedings of the Seventh International Workshop on Climate Informatics (CI)"},{"key":"ref37","article-title":"Sgdlibrary: A matlab library for stochastic optimization algorithms","volume":"18","author":"kasai","year":"2018","journal-title":"Journal of Machine Learning Research (JMLR)"},{"key":"ref36","year":"0","journal-title":"Columbia University Image Library (COIL 100)"},{"key":"ref35","article-title":"High Performance Optimization","volume":"33","author":"andersen","year":"2000","journal-title":"The Mosek Interior Point Optimizer for Linear Programming An Implementation of the Homogeneous Algorithm"},{"key":"ref34","article-title":"Sparse projections onto the simplex","author":"kyrillidis","year":"2013","journal-title":"ICML"},{"key":"ref10","article-title":"On the equivalence of nonnegative matrix factorization and spectral clustering (sdm)","author":"chris","year":"0","journal-title":"Proceedings of the 2005 SIAM International Conference on Data Mining"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2012.03.077"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8461325"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.23919\/EUSIPCO.2018.8553610"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054660"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2659647"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1561\/9781680835519"},{"key":"ref17","author":"villani","year":"2008","journal-title":"Optimal Transport Old and New"},{"key":"ref18","article-title":"Multi-view wasserstein discriminant analysis with entropic regularized wasserstein distance","author":"kasai","year":"0","journal-title":"IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP)"},{"key":"ref19","article-title":"The hardness of k-means clustering","author":"dasgupta","year":"2007","journal-title":"Tech Rep Technical Report CS2007–0890"},{"key":"ref28","article-title":"Stochastic wasserstein barycen-ters","author":"claici","year":"2018","journal-title":"ICML"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2002.1017616"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-016-0549-x"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312248"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.12"},{"key":"ref29","first-page":"1","article-title":"Onthecomputationofwassersteinbarycenters","volume":"176","author":"puccetti","year":"2020","journal-title":"Journal of Multivariate Analysis"},{"key":"ref5","article-title":"Using the triangle inequality to accelerate k-means","author":"elkan","year":"2003","journal-title":"ICML"},{"key":"ref8","article-title":"Yinyang k-means: A drop-in replacement of the classic k-means with consistent speedup","author":"ding","year":"2015","journal-title":"ICML"},{"key":"ref7","article-title":"Accelerated k-means with adaptive distance bounds","author":"drake","year":"2012","journal-title":"NIPS Optim Workshop"},{"key":"ref2","article-title":"An efficient k-means clustering algorithm","author":"alsabti","year":"0","journal-title":"IPPS\/SPDP Workshop on High Performance Data Mining"},{"key":"ref9","article-title":"Speeding up k-means by approximating euclidean distances via block vectors","author":"bottesch","year":"2016","journal-title":"ICML"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00202-1_24"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.75"},{"key":"ref21","article-title":"K-means++: The advantages of careful seeding","author":"arthur","year":"0","journal-title":"Proc 18th Ann ACM-SIAM Symp Discr Alg (SODA)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/141000439"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.14778\/2180912.2180915"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-014-0506-3"},{"key":"ref25","article-title":"Fast computation of wasserstein barycenters","author":"cuturi","year":"2014","journal-title":"ICML"}],"event":{"name":"2020 25th International Conference on Pattern Recognition (ICPR)","location":"Milan, Italy","start":{"date-parts":[[2021,1,10]]},"end":{"date-parts":[[2021,1,15]]}},"container-title":["2020 25th International Conference on Pattern Recognition (ICPR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9411940\/9411911\/09412131.pdf?arnumber=9412131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:40:46Z","timestamp":1652197246000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9412131\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,10]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/icpr48806.2021.9412131","relation":{},"subject":[],"published":{"date-parts":[[2021,1,10]]}}}