{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T13:46:10Z","timestamp":1774446370373,"version":"3.50.1"},"reference-count":25,"publisher":"IEEE","license":[{"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,1,10]]},"DOI":"10.1109\/icpr48806.2021.9412777","type":"proceedings-article","created":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T02:15:54Z","timestamp":1620267354000},"page":"969-974","source":"Crossref","is-referenced-by-count":6,"title":["Penalized K-Means Algorithms for Finding the Number of Clusters"],"prefix":"10.1109","author":[{"given":"Behzad","family":"Kamgar-Parsi","sequence":"first","affiliation":[{"name":"Office of Naval Research,Mathematics and Computer Science Division,Arlington,VA,USA,22203"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Behrooz","family":"Kamgar-Parsi","sequence":"additional","affiliation":[{"name":"Naval Research Laboratory,Information Technoloy Division,Washington, DC,USA,20375"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.06.039"},{"key":"ref2","first-page":"1027","article-title":"k-means++: The Advantages of Careful Seeding","volume-title":"Proc. Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Arthur","year":"2007"},{"key":"ref3","first-page":"55","article-title":"Fast and Provably Good Seedings for k-Means","volume-title":"Proc. NIPS 2016","author":"Bachem"},{"key":"ref4","volume-title":"Recombinator-k-means: Enhancing k-means++ by seeding from pools of previous runs","author":"Baldassi","year":"2019"},{"key":"ref5","volume-title":"Foundations of Data Science","author":"Blum","year":"2018"},{"key":"ref6","volume-title":"Pattern Classification","author":"Duda","year":"2003"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2019.1647846"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2013.11.012"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3626-0"},{"key":"ref10","volume-title":"Algorithms for Clustering Data","author":"Jain","year":"1988"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF00195859"},{"key":"ref12","volume-title":"Penalized k-means algorithms for finding the correct number of clusters in a dataset","author":"Kamgar-Parsi","year":"2019"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.5749\/j.ctt22rbjz5.9"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2002.1017616"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.2307\/2531893"},{"key":"ref16","article-title":"Revisiting k-means: New Algorithms via Bayesian Nonparametrics","volume-title":"Proc. ICML","author":"Kulis"},{"key":"ref17","first-page":"17","article-title":"A parallel method for earth movers distance","author":"Li","year":"2017","journal-title":"UCLA Comput. Appl. Math. Pub. (CAM) Rep."},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1980.1094577"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071"},{"key":"ref21","volume-title":"Machine Learning: A Probabilistic Perspective","author":"Murphy","year":"2012"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.144705"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISITC.2007.15"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-87811-9"}],"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\/09412777.pdf?arnumber=9412777","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,28]],"date-time":"2024-09-28T05:16:06Z","timestamp":1727500566000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9412777\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,10]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/icpr48806.2021.9412777","relation":{},"subject":[],"published":{"date-parts":[[2021,1,10]]}}}