{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:27:18Z","timestamp":1742912838625,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440383"},{"type":"electronic","value":"9783540456834"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45683-x_28","type":"book-chapter","created":{"date-parts":[[2007,5,22]],"date-time":"2007-05-22T22:42:27Z","timestamp":1179873747000},"page":"244-254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Change-Point Estimation Using New Minimum Message Length Approximations"],"prefix":"10.1007","author":[{"given":"Leigh J.","family":"Fitzgibbon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David L.","family":"Dowe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lloyd","family":"Allison","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,21]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1093\/comjnl\/11.2.185","volume":"11","author":"C.S. Wallace","year":"1968","unstructured":"Wallace, C.S., Boulton, D.M.: An information measure for classification. Computer Journal 11 (1968) 185\u2013194","journal-title":"Computer Journal"},{"key":"28_CR2","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":"Wallace, C.S., Freeman, P.R.: Estimation and inference by compact encoding (with discussion). Journal of the Royal Statistical Society. Series B (Methodological) 49 (1987) 240\u2013265","journal-title":"Journal of the Royal Statistical Society. Series B (Methodological)"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1093\/comjnl\/42.4.270","volume":"42","author":"C.S. Wallace","year":"1999","unstructured":"Wallace, C.S., Dowe, D.L.: Minimum message length and Kolmogorov complexity. Computer Journal 42 (1999) 270\u2013283","journal-title":"Computer Journal"},{"key":"28_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/3-540-61863-5_36","volume-title":"Proceedings of the Seventh International Workshop on Algorithmic Learning Theory","author":"R.A. Baxter","year":"1996","unstructured":"Baxter, R.A., Oliver, J.J.: The kindest cut: minimum message length segmentation. In Arikawa, S., Sharma, A.K., eds.: Proceedings of the Seventh International Workshop on Algorithmic Learning Theory. Volume 1160 of LNCS., Springer-Verlag Berlin (1996) 83\u201390"},{"key":"28_CR5","first-page":"3168","volume-title":"Technical Report 97\/336","author":"J.J. Oliver","year":"1997","unstructured":"Oliver, J.J., Forbes, C.S.: Bayesian approaches to segmenting a simple time series. Technical Report 97\/336, Department Computer Science, Monash University, Australia 3168 (1997)"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Oliver, J.J., Baxter, R.A., Wallace, C.S.: Minimum message length segmentation. In Wu, X., Kotagiri, R., Korb, K., eds.: Research and Development in Knowledge Discovery and Data Mining (PAKDD-98), Springer (1998) 83\u201390","DOI":"10.1007\/3-540-64383-4_19"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Viswanathan, M., Wallace, C.S., Dowe, D.L., Korb, K.: Finding cutpoints in noisy binary sequences-a revised empirical evaluation. In: Australian Joint Conference on Artificial Intelligence. (1999)","DOI":"10.1007\/3-540-46695-9_34"},{"key":"28_CR8","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/3-540-40992-0_5","volume-title":"Proceedings of the Eleventh International Conference on Algorithmic Learning Theory (ALT2000)","author":"L.J. Fitzgibbon","year":"2000","unstructured":"Fitzgibbon, L.J., Allison, L., Dowe, D.L.: Minimum message length grouping of ordered data. In Arimura, H., Jain, S., eds.: Proceedings of the Eleventh International Conference on Algorithmic Learning Theory (ALT2000). LNAI, Springer-Verlag Berlin (2000) 56\u201370"},{"key":"28_CR9","unstructured":"Farr, G.E., Wallace, C.S.: Algorithmic and combinatorial problems in strict minimum message length inference. In: Research on Combinatorial Algorithms. (1997) 50\u201358"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Dowe, D.L., Baxter, R.A., Oliver, J.J., Wallace, C.S.: Point estimation using the Kullback-Leibler loss function and MML. In: Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD98). Volume LNAI of 1394., Springer-Verlag (1998) 87\u201395","DOI":"10.1007\/3-540-64383-4_8"},{"key":"28_CR11","unstructured":"Baxter, R.A.: Minimum Message Length Inductive Inference: Theory and Applications. PhD thesis, Department of Computer Science, Monash University (1996)"},{"key":"28_CR12","volume-title":"PAKDD-98 Tutorial: Data Mining","author":"C.S. Wallace","year":"1998","unstructured":"Wallace, C.S.: PAKDD-98 Tutorial: Data Mining. Monash University, Australia (Book in preparation) (1998)"},{"key":"28_CR13","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1080\/01621459.1958.10501479","volume":"53","author":"W.D. Fisher","year":"1958","unstructured":"Fisher, W.D.: On grouping for maximum homogeneity. Journal of the American Statistical Society 53 (1958) 789\u2013798","journal-title":"Journal of the American Statistical Society"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1007344726582","volume":"27","author":"M. Kearns","year":"1997","unstructured":"Kearns, M., Mansour, Y., Ng, A.Y., Ron, D.: An experimental and theoretical comparison of model selection methods. Machine Learning 27 (1997) 7\u201350","journal-title":"Machine Learning"},{"key":"28_CR15","volume-title":"Honours thesis","author":"E. Lam","year":"2000","unstructured":"Lam, E.: Improved approximations in MML. Honours thesis, Monash University, School of Computer Science and Software Engineering, Monash University, Clayton, Australia (2000)"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J.J. Rissanen","year":"1978","unstructured":"Rissanen, J.J.: Modeling by shortest data description. Automatica 14 (1978) 465\u2013471","journal-title":"Automatica"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2002: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45683-X_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T01:50:50Z","timestamp":1676685050000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45683-X_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440383","9783540456834"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45683-x_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"21 August 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}