{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:51:18Z","timestamp":1743079878873,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":17,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307688"},{"type":"electronic","value":"9780387301648"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-0-387-30164-8_542","type":"book-chapter","created":{"date-parts":[[2010,12,29]],"date-time":"2010-12-29T17:30:36Z","timestamp":1293643836000},"page":"668-674","source":"Crossref","is-referenced-by-count":1,"title":["Minimum Message Length"],"prefix":"10.1007","author":[{"given":"Rohan A.","family":"Baxter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"542_CR1_542","unstructured":"Allison, L. (2009). 27\/1\/2010 MML website, http:\/\/www.allisons.org\/ll\/MML\/"},{"key":"542_CR2_542","first-page":"1304","volume-title":"Proceedings of the fifteenth international joint conference on artificial intelligence","author":"H Dai","year":"1997","unstructured":"Dai, H., Korb, K. B., Wallace, C. S., & Wu, X. (1997). A study of causal discovery with weak links and small samples. In Proceedings of the fifteenth international joint conference on artificial intelligence (pp.\u00a01304\u20131309). San Francisco: Morgan Kaufman."},{"key":"542_CR3_542","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1093\/bjps\/axm033","volume":"58","author":"DL Dowe","year":"2007","unstructured":"Dowe, D. L., Gardner, S. B., & Oppy, G. (2007). Bayes not bust!: Why simplicity is no problem for Bayesians. The British Journal for the Philosophy of Science, 58, 709\u2013754.","journal-title":"The British Journal for the Philosophy of Science"},{"issue":"4","key":"542_CR4_542","doi-asserted-by":"crossref","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. Statistics and Computing, 9(4), 269\u2013278.","journal-title":"Statistics and Computing"},{"issue":"3","key":"542_CR5_542","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1093\/comjnl\/45.3.285","volume":"45","author":"GE Farr","year":"2002","unstructured":"Farr, G. E, & Wallace, C. S. (2002). The complexity of strict minimum message length inference. The Computer Journal, 45(3), 285\u2013292.","journal-title":"The Computer Journal"},{"issue":"4","key":"542_CR6_542","doi-asserted-by":"crossref","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 Transactions on Neural Networks, 15(4), 800\u2013810.","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"2","key":"542_CR7_542","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1111\/j.1751-5823.2001.tb00456.x","volume":"69","author":"AD Lanterman","year":"2001","unstructured":"Lanterman, A. D. (2001). Schwarz, Wallace and Rissanen: Intertwining themes in theories of model selection. International Statistical Review, 69(2), 185\u2013212.","journal-title":"International Statistical Review"},{"key":"542_CR8_542","unstructured":"MML software: www.datamining.monash.edu.au\/software,\u00a027\/1\/2010 http:\/\/allisons.org\/ll\/Images\/People\/Wallace\/FactorSnob\/"},{"key":"542_CR9_542","first-page":"486","volume-title":"Proceedings of the fifteenth conference of uncertainty in artificial intelligence (UAI-99)","author":"JR Neil","year":"1999","unstructured":"Neil, J. R., Wallace, C. S., & Korb, K. B. (1999). Learning Bayesian networks with restricted interactions. In K. B. Laskey & H. Prade (Eds.), Proceedings of the fifteenth conference of uncertainty in artificial intelligence (UAI-99) (pp. 486\u2013493). San Francisco: Morgan Kaufmann."},{"key":"542_CR10_542","volume-title":"Learning hybrid Bayesian networks by MML. Lecture notes in computer science: AI 2006 \u2013 advances in artificial intelligence (Vol. 4304, pp.\u00a0192\u2013203)","author":"R O\u2019Donnell","year":"2006","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. 4304, pp.\u00a0192\u2013203). Berlin: Springer."},{"key":"542_CR11_542","volume-title":"Advances in computing and information-ICCI 1990, No. 468 in Lecture notes in computer science","author":"CS Wallace","year":"1990","unstructured":"Wallace, C. S. (1990). Classification by minimum-message length inference. In S. G. Akl, et al. (Eds.), Advances in computing and information-ICCI 1990, No. 468 in Lecture notes in computer science. Berlin: Springer."},{"key":"542_CR12_542","volume-title":"Statistical and inductive inference by MML: Information sciences and statistics","author":"CS Wallace","year":"2005","unstructured":"Wallace, C. S. (2005). Statistical and inductive inference by MML: Information sciences and statistics. Berlin: Springer."},{"key":"542_CR13_542","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1093\/comjnl\/11.2.185","volume":"11","author":"CS Wallace","year":"1968","unstructured":"Wallace, C. S., & Boulton, D. M. (1968). An information measure for classification. Computer Journal, 11, 185\u2013194.","journal-title":"Computer Journal"},{"issue":"3","key":"542_CR14_542","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1093\/comjnl\/18.3.236","volume":"18","author":"CS Wallace","year":"1975","unstructured":"Wallace, C. S., & Boulton, D. M. (1975). An information measure for single-link classification. The Computer Journal, 18(3), 236\u2013238.","journal-title":"The Computer Journal"},{"issue":"4","key":"542_CR15_542","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1093\/comjnl\/42.4.330","volume":"42","author":"CS Wallace","year":"1999","unstructured":"Wallace, C. S., & Dowe, D. L. (1999). Minimum message length and Kolmogorov complexity. Computer Journal, 42(4), 330\u2013337.","journal-title":"Computer Journal"},{"key":"542_CR16_542","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, C. S., & Freeman, P. R. (1987). Estimation and inference by compact coding. Journal of the Royal Statistical Society (Series\u00a0B), 49, 240\u2013252.","journal-title":"Journal of the Royal Statistical Society (Series B)"},{"key":"542_CR17_542","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1022646101185","volume":"11","author":"CS Wallace","year":"1993","unstructured":"Wallace, C. S., & Patrick, J. D. (1993). Coding decision trees. Machine Learning, 11, 7\u201322.","journal-title":"Machine Learning"}],"container-title":["Encyclopedia of Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30164-8_542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T05:31:07Z","timestamp":1740807067000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30164-8_542"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9780387307688","9780387301648"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30164-8_542","relation":{},"subject":[],"published":{"date-parts":[[2011]]}}}