{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:37:07Z","timestamp":1725568627870},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161834"},{"type":"electronic","value":"9783642161841"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16184-1_18","type":"book-chapter","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T13:40:58Z","timestamp":1288705258000},"page":"251-265","source":"Crossref","is-referenced-by-count":1,"title":["Gaussian Clusters and Noise: An Approach Based on the Minimum Description Length Principle"],"prefix":"10.1007","author":[{"given":"Panu","family":"Luosto","sequence":"first","affiliation":[]},{"given":"Jyrki","family":"Kivinen","sequence":"additional","affiliation":[]},{"given":"Heikki","family":"Mannila","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: SODA 2007: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 1027\u20131035. Society for Industrial and Applied Mathematics (2007)"},{"issue":"1","key":"18_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A.P. Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society. Series B (Methodological)\u00a039(1), 1\u201338 (1977)","journal-title":"Journal of the Royal Statistical Society. Series B (Methodological)"},{"key":"18_CR3","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4643.001.0001","volume-title":"The Minimum Description Length Principle","author":"P.D. Gr\u00fcnwald","year":"2007","unstructured":"Gr\u00fcnwald, P.D.: The Minimum Description Length Principle. The MIT Press, Cambridge (2007)"},{"volume-title":"Advances in Minimum Description Length Theory and Applications","year":"2005","key":"18_CR4","unstructured":"Gr\u00fcnwald, P.D., Myung, I.J., Pitt, M.A. (eds.): Advances in Minimum Description Length Theory and Applications. The MIT Press, Cambridge (2005)"},{"key":"18_CR5","unstructured":"Kontkanen, P.: Computationally Efficient Methods for MDL-Optimal Density Estimation and Data Clustering. PhD thesis, University of Helsinki, Department of Computer Science (2009)"},{"issue":"5","key":"18_CR6","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.jmva.2006.11.013","volume":"98","author":"M. Meil\u0103","year":"2007","unstructured":"Meil\u0103, M.: Comparing clusterings\u2013an information based distance. Journal of Multivariate Analysis\u00a098(5), 873\u2013895 (2007)","journal-title":"Journal of Multivariate Analysis"},{"issue":"5","key":"18_CR7","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J. Rissanen","year":"1978","unstructured":"Rissanen, J.: Modeling by shortest data description. Automatica\u00a014(5), 465\u2013471 (1978)","journal-title":"Automatica"},{"issue":"2","key":"18_CR8","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1214\/aos\/1176346150","volume":"11","author":"J. Rissanen","year":"1983","unstructured":"Rissanen, J.: A universal prior for integers and estimation by minimum description length. The Annals of Statistics\u00a011(2), 416\u2013431 (1983)","journal-title":"The Annals of Statistics"},{"issue":"3","key":"18_CR9","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1111\/j.2517-6161.1987.tb01694.x","volume":"49","author":"J. Rissanen","year":"1987","unstructured":"Rissanen, J.: Stochastic complexity. Journal of the Royal Statistical Society. Series B (Methodological)\u00a049(3), 223\u2013239 (1987)","journal-title":"Journal of the Royal Statistical Society. Series B (Methodological)"},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/18.481776","volume":"42","author":"J. Rissanen","year":"1996","unstructured":"Rissanen, J.: Fisher information and stochastic complexity. IEEE Transactions on Information Theory\u00a042(1), 40\u201347 (1996)","journal-title":"IEEE Transactions on Information Theory"},{"key":"18_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-68812-1","volume-title":"Information and Complexity in Statistical Modeling","author":"J. Rissanen","year":"2007","unstructured":"Rissanen, J.: Information and Complexity in Statistical Modeling. Springer, New York (2007)"},{"key":"18_CR12","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032770","volume-title":"Average case analysis of algorithms on sequences","author":"W. Szpankowski","year":"2001","unstructured":"Szpankowski, W.: Average case analysis of algorithms on sequences. John Wiley & Sons, Chichester (2001)"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16184-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T01:04:43Z","timestamp":1559783083000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16184-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161834","9783642161841"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16184-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}