{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:35:14Z","timestamp":1743140114357,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":19,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781489976857"},{"type":"electronic","value":"9781489976871"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-1-4899-7687-1_547","type":"book-chapter","created":{"date-parts":[[2017,4,13]],"date-time":"2017-04-13T12:32:16Z","timestamp":1492086736000},"page":"827-834","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Message Length"],"prefix":"10.1007","author":[{"given":"Rohan A.","family":"Baxter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,14]]},"reference":[{"unstructured":"Allison L (2009) MML website. http:\/\/www.allisons.org\/ll\/MML\/","key":"547_CR13171"},{"key":"547_CR13172","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1093\/bjps\/axm033","volume":"58","author":"DL Dowe","year":"2007","unstructured":"Dowe DL, Gardner SB, Oppy G (2007) Bayes not bust!: why simplicity is no problem for Bayesians. Brit J Phil Sci 58:709\u2013754","journal-title":"Brit J Phil Sci"},{"key":"547_CR13173","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxt145","author":"JG Dowty","year":"2013","unstructured":"Dowty JG (2013) SMML estimators for 1-dimensional continuous data. Comput J. doi:10.1093\/comjnl\/bxt145","journal-title":"Comput J"},{"key":"547_CR13174","first-page":"1304","volume-title":"Proceedings of fifteenth international joint conference on artificial intelligence","author":"H Dai","year":"1997","unstructured":"Dai H, Korb KB, Wallace CS, Wu X (1997) A study of causal discovery with weak links and small samples. In: Proceedings of fifteenth international joint conference on artificial intelligence. Morgan Kaufman, San Francisco, pp\u00a01304\u20131309"},{"issue":"4","key":"547_CR13175","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1023\/A:1008907921792","volume":"9","author":"T Edgoose","year":"1999","unstructured":"Edgoose T, Allison L (1999) MML Markov classification of sequential data. Stat Comput 9(4):269\u2013278","journal-title":"Stat Comput"},{"issue":"3","key":"547_CR13176","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1093\/comjnl\/45.3.285","volume":"45","author":"GE Farr","year":"2002","unstructured":"Farr GE, Wallace CS (2002) The complexity of strict minimum message length inference. Comput J 45(3): 285\u2013292","journal-title":"Comput J"},{"key":"547_CR13177","volume-title":"The minimum description length principle","author":"P Grunwald","year":"2008","unstructured":"Grunwald P (2008) The minimum description length principle. MIT Press, Cambridge"},{"issue":"4","key":"547_CR13178","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1109\/TNN.2004.828762","volume":"15","author":"A Honkela","year":"2004","unstructured":"Honkela A, Valpola H (2004) Variational learning and bits-back coding: an information-theoretic view to Bayesian learning. IEEE Trans Neural Netw 15(4):800\u2013810","journal-title":"IEEE Trans Neural Netw"},{"issue":"2","key":"547_CR13179","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1111\/j.1751-5823.2001.tb00456.x","volume":"69","author":"AD Lanterman","year":"2001","unstructured":"Lanterman AD (2001) Schwarz, Wallace and Rissanen: intertwining themes in theories of model selection. Int Stat Rev 69(2):185\u2013212","journal-title":"Int Stat Rev"},{"unstructured":"MML software: www.datamining.monash.edu.au\/software , http:\/\/allisons.org\/ll\/Images\/People\/Wallace\/FactorSnob\/","key":"547_CR13180"},{"unstructured":"Neil JR, Wallace CS, Korb KB, Learning Bayesian networks with restricted interactions, in Laskey and Prade. In: Proceedings of the fifteenth conference of uncertainty in artificial intelligence (UAI-99), Stockholm, pp\u00a0486\u2013493","key":"547_CR13181"},{"doi-asserted-by":"crossref","unstructured":"O\u2019Donnell R, Allison L, Korb K (2006) Learning hybrid Bayesian networks by MML. Lecture notes in computer science: AI 2006 \u2013 Advances in artificial intelligence, vol\u00a04304. Springer, Berlin\/New York, pp\u00a0192\u2013203","key":"547_CR13182","DOI":"10.1007\/11941439_23"},{"doi-asserted-by":"crossref","unstructured":"Wallace CS (1990) Classification by minimum-message length inference. In: Akl SG et al (eds) Advances in computing and information-ICCI 1990. No.\u00a0468 in lecture notes in computer science. Springer, Berlin","key":"547_CR13183","DOI":"10.1007\/3-540-53504-7_63"},{"key":"547_CR13184","volume-title":"Statistical & inductive inference by MML","author":"CS Wallace","year":"2005","unstructured":"Wallace CS (2005) Statistical & inductive inference by MML. Information sciences and statistics. Springer, New York"},{"key":"547_CR13185","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1093\/comjnl\/11.2.185","volume":"11","author":"CS Wallace","year":"1968","unstructured":"Wallace CS, Boulton DM (1968) An information measure for classification. Comput J 11:185\u2013194","journal-title":"Comput J"},{"issue":"3","key":"547_CR13186","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1093\/comjnl\/18.3.236","volume":"18","author":"CS Wallace","year":"1975","unstructured":"Wallace CS, Boulton DM (1975) An information measure for single-link classification. Comput J 18(3):236\u2013238","journal-title":"Comput J"},{"issue":"4","key":"547_CR13187","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1093\/comjnl\/42.4.330","volume":"42","author":"CS Wallace","year":"1999","unstructured":"Wallace CS, Dowe DL (1999) Minimum message length and Kolmogorov complexity. Comput J 42(4):330\u2013337","journal-title":"Comput J"},{"key":"547_CR13188","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1111\/j.2517-6161.1987.tb01695.x","volume":"49","author":"CS Wallace","year":"1987","unstructured":"Wallace CS, Freeman PR (1987) Estimation and inference by compact coding. J. R. Stat. Soc. (Ser B) 49:240\u2013252","journal-title":"J. R. Stat. Soc. (Ser B)"},{"key":"547_CR13189","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1022646101185","volume":"11","author":"CS Wallace","year":"1993","unstructured":"Wallace CS, Patrick JD (1993) Coding decision trees. Mach Learn 11:7\u201322","journal-title":"Mach Learn"}],"container-title":["Encyclopedia of Machine Learning and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4899-7687-1_547","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T15:29:33Z","timestamp":1719156573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4899-7687-1_547"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9781489976857","9781489976871"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-1-4899-7687-1_547","relation":{},"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"14 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}