{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:06:31Z","timestamp":1729652791742,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/isit.2009.5205937","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T15:09:52Z","timestamp":1251126592000},"page":"1318-1322","source":"Crossref","is-referenced-by-count":3,"title":["Minimum description length and clustering with exemplars"],"prefix":"10.1109","author":[{"given":"Po-Hsiang","family":"Lai","sequence":"first","affiliation":[]},{"given":"Joseph A.","family":"O'Sullivan","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Pless","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"year":"2003","author":"schrijver","journal-title":"Combinatorial Optimization","key":"17"},{"doi-asserted-by":"publisher","key":"18","DOI":"10.1109\/TIT.2005.844059"},{"key":"15","first-page":"3","article-title":"universal sequential codi ng of single messages","volume":"76","author":"shtarkov","year":"1987","journal-title":"Probl Inform Transm"},{"doi-asserted-by":"publisher","key":"16","DOI":"10.1109\/TIT.1984.1056936"},{"key":"13","first-page":"205","article-title":"information geometry and alternating minimization procedures","volume":"1","author":"csisz?ar","year":"1984","journal-title":"Statistics and Decisions Supplement Issue"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.1109\/18.720554"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1214\/aos\/1176346150"},{"key":"12","first-page":"727","article-title":"x-means: extend ing k-means with efficient estimation of the number of clusters","author":"pellcg","year":"2000","journal-title":"Proceesings of the 17th international coriference of machine learning"},{"year":"2000","author":"van dongen","journal-title":"Graph Clustering by Flow Simulation","key":"3"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1109\/TNN.2005.845141"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1109\/ICCV.2005.149"},{"year":"0","author":"bouman","journal-title":"Cluster An unsupervised algorithm for modeling gaussian mixtures","key":"10"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1214\/aos\/1176344136"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1109\/TAC.1974.1100705"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1109\/18.481776"},{"key":"4","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1126\/science.1136800","article-title":"clustering by passing messages between data points","volume":"315","author":"frey","year":"2007","journal-title":"Science"},{"key":"9","first-page":"323","article-title":"an mdl framework for data clu stering","author":"kontkanen","year":"2005","journal-title":"Advances in Minimum Description Length"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1093\/comjnl\/42.4.270"}],"event":{"name":"2009 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2009,6,28]]},"location":"Seoul, South Korea","end":{"date-parts":[[2009,7,3]]}},"container-title":["2009 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5179947\/5205248\/05205937.pdf?arnumber=5205937","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T23:05:26Z","timestamp":1497827126000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5205937\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2009.5205937","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}