{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T07:10:17Z","timestamp":1737097817847,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540412373"},{"type":"electronic","value":"9783540409922"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40992-0_5","type":"book-chapter","created":{"date-parts":[[2007,6,13]],"date-time":"2007-06-13T00:01:19Z","timestamp":1181692879000},"page":"56-70","source":"Crossref","is-referenced-by-count":10,"title":["Minimum Message Length Grouping of Ordered Data"],"prefix":"10.1007","author":[{"given":"Leigh J.","family":"Fitzgibbon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lloyd","family":"Allison","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David L.","family":"Dowe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,19]]},"reference":[{"unstructured":"H. Akaike. Information theory and an extension of the maximum likelihood principle. In B. N. Petrov and F. Csaki, editors, Proceeding 2nd International Symposium on Information Theory, pages 267\u2013281. Akademia Kiado, Budapest, 1973.","key":"5_CR1"},{"unstructured":"R. A. Baxter and J. J. Oliver. MDL and MML: Similarities and differences. Technical report TR 207, Dept. of Computer Science, Monash University, Clayton, Victoria 3168, Australia, 1994.","key":"5_CR2"},{"doi-asserted-by":"crossref","unstructured":"R. A. Baxter and J. J. Oliver. The kindest cut: minimum message length segmentation. In S. Arikawa and A. K. Sharma, editors, Proc. 7th Int. Workshop on Algorithmic Learning Theory, volume 1160 of LCNS, pages 83\u201390. Springer-Verlag Berlin, 1996.","key":"5_CR3","DOI":"10.1007\/3-540-61863-5_36"},{"doi-asserted-by":"crossref","unstructured":"J.H. Conway and N.J.A Sloane. Sphere Packings, Lattices and Groups. Springer-Verlag, London, 1988.","key":"5_CR4","DOI":"10.1007\/978-1-4757-2016-7"},{"doi-asserted-by":"crossref","unstructured":"D. L. Dowe, R. A. Baxter, J. J. Oliver, and C. S. Wallace. Point estimation using the Kullback-Leibler loss function and MML. In Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD98), volume 1394 of LNAI, pages 87\u201395, 1998.","key":"5_CR5","DOI":"10.1007\/3-540-64383-4_8"},{"doi-asserted-by":"crossref","unstructured":"D. L. Dowe, J. J. Oliver, and C. S. Wallace. MML estimation of the parameters of the spherical Fisher distribution. In S. Arikawa and A. K. Sharma, editors, Proc. 7th Int. Workshop on Algorithmic Learning Theory, volume 1160 of LCNS, pages 213\u2013227. Springer-Verlag Berlin, 1996.","key":"5_CR6","DOI":"10.1007\/3-540-61863-5_48"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1023\/A:1008907921792","volume":"9","author":"T. Edgoose","year":"1999","unstructured":"T. Edgoose and L. Allison. MML markov classification of sequential data. Statistics and Computing, 9:269\u2013278, 1999.","journal-title":"Statistics and Computing"},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1080\/01621459.1958.10501479","volume":"53","author":"W. D. Fisher","year":"1958","unstructured":"W. D. Fisher. On grouping for maximum homogeneity. Jrnl. Am. Stat. Soc., 53:789\u2013798, 1958.","journal-title":"Jrnl. Am. Stat. Soc."},{"issue":"430","key":"5_CR9","doi-asserted-by":"publisher","first-page":"773","DOI":"10.2307\/2291091","volume":"90","author":"R. E. Kass","year":"1995","unstructured":"R. E. Kass and A. E. Raftery. Bayes factors. Journal of the American Statistical Association, 90(430):773\u2013795, 1995.","journal-title":"Journal of the American Statistical Association"},{"doi-asserted-by":"crossref","unstructured":"J. J. Oliver, R. A. Baxter, and C. S. Wallace. Minimum message length segmentation. In X. Wu, R. Kotagiri, and K. Korb, editors, Research and Development in Knowledge Discovery and Data Mining (PAKDD-98), pages 83\u201390. Springer, 1998.","key":"5_CR10","DOI":"10.1007\/3-540-64383-4_19"},{"unstructured":"J. J. Oliver and C. S. Forbes. Bayesian approaches to segmenting a simple time series. Technical Report 97\/336, Dept. Computer Science, Monash University, Australia 3168, December 1997.","key":"5_CR11"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J. J. Rissanen","year":"1978","unstructured":"J. J. Rissanen. Modeling by shortest data description. Automatica, 14:465\u2013471, 1978.","journal-title":"Automatica"},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1214\/aos\/1176346150","volume":"11","author":"J. J. Rissanen","year":"1983","unstructured":"J. J. Rissanen. A universal prior for integers and estimation by minimum description length. Annals of Statistics, 11(2):416\u2013431, 1983.","journal-title":"Annals of Statistics"},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1093\/comjnl\/42.4.260","volume":"42","author":"J. J. Rissanen","year":"1999","unstructured":"J. J. Rissanen. Hypothesis selection and testing by the MDL principle. Computer Jrnl., 42(4):260\u2013269, 1999.","journal-title":"Computer Jrnl."},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1214\/aos\/1176344136","volume":"6","author":"G. Schwarz","year":"1978","unstructured":"G. Schwarz. Estimating the dimension of a model. The Annals of Statistics, 6:461\u2013464, 1978.","journal-title":"The Annals of Statistics"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0255(83)90007-5","volume":"29","author":"S. Sclove","year":"1983","unstructured":"S. Sclove. Time-series segmentation: A model and a method. Information Sciences, 29:7\u201325, 1983.","journal-title":"Information Sciences"},{"doi-asserted-by":"crossref","unstructured":"M. Viswanathan, C.S. Wallace, D.L. Dowe, and K. Korb. Finding cutpoints in noisy binary sequences-a revised empirical evaluation. In 12th Australian Joint Conference onArtificial Intelligence, 1999. A sequel has been submitted to Machine Learning Journal.","key":"5_CR17","DOI":"10.1007\/3-540-46695-9_34"},{"issue":"2","key":"5_CR18","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1093\/comjnl\/11.2.185","volume":"11","author":"C. S. Wallace","year":"1968","unstructured":"C. S. Wallace and D. M. Boulton. An information measure for classiifcation. Computer Jrnl., 11(2):185\u2013194, August 1968.","journal-title":"Computer Jrnl."},{"issue":"4","key":"5_CR19","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1093\/comjnl\/42.4.270","volume":"42","author":"C. S. Wallace","year":"1999","unstructured":"C. S. Wallace and D. L. Dowe. Minimum message length and Kolmogorov complexity. Computer Jrnl., 42(4):270\u2013283, 1999.","journal-title":"Computer Jrnl."},{"issue":"4","key":"5_CR20","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1093\/comjnl\/42.4.345","volume":"42","author":"C. S. Wallace","year":"1999","unstructured":"C. S. Wallace and D. L. Dowe. Rejoinder. Computer Jrnl., 42(4):345\u2013357, 1999.","journal-title":"Computer Jrnl."},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1023\/A:1008992619036","volume":"10","author":"C. S. Wallace","year":"2000","unstructured":"C. S. Wallace and D. L. Dowe. MML clustering of multi-state, Poisson, von Mises circular and Gaussian distributions. Statistics and Computing, 10:73\u201383, 2000.","journal-title":"Statistics and Computing"},{"key":"5_CR22","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1111\/j.2517-6161.1987.tb01695.x","volume":"49","author":"C. S. Wallace","year":"1987","unstructured":"C. S. Wallace and P. R. Freeman. Estimation and inference by compact encoding (with discussion). Journal of the Royal Statistical Society series B, 49:240\u2013265, 1987.","journal-title":"Journal of the Royal Statistical Society series B"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40992-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T06:42:50Z","timestamp":1737096170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40992-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540412373","9783540409922"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-40992-0_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}