{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T05:35:04Z","timestamp":1744695304039,"version":"3.30.1"},"reference-count":29,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,8,1]],"date-time":"2000-08-01T00:00:00Z","timestamp":965088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":4741,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2000,8]]},"DOI":"10.1016\/s0004-3702(00)00034-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:18:29Z","timestamp":1027606709000},"page":"1-29","source":"Crossref","is-referenced-by-count":22,"title":["Applying MDL to learn best model granularity"],"prefix":"10.1016","volume":"121","author":[{"given":"Qiong","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Vit\u00e1nyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/S0004-3702(00)00034-5_ID008","doi-asserted-by":"crossref","first-page":"2743","DOI":"10.1109\/18.720554","article-title":"The minimum description length principle in coding and modelling","volume":"Vol. IT-44","author":"Barron","year":"1998","journal-title":"IEEE Trans. Inform. Theory"},{"year":"1995","series-title":"Neural Networks for Pattern Recognition","author":"Bishop","key":"10.1016\/S0004-3702(00)00034-5_ID009"},{"year":"1991","series-title":"Elements of Information Theory","author":"Cover","key":"10.1016\/S0004-3702(00)00034-5_ID010"},{"key":"10.1016\/S0004-3702(00)00034-5_ID011","series-title":"Proc. IJCAI-89, Detroit, MI","first-page":"843","article-title":"An application of minimum description length principle to online recognition of handprinted alphanumerals","author":"Gao","year":"1989"},{"year":"1961","series-title":"Theory of Probability","author":"Jeffreys","key":"10.1016\/S0004-3702(00)00034-5_ID012"},{"year":"1994","series-title":"An Introduction to Computational Learning Theory","author":"Kearns","key":"10.1016\/S0004-3702(00)00034-5_ID013"},{"issue":"4","key":"10.1016\/S0004-3702(00)00034-5_ID014","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF03024407","article-title":"The miraculous universal distribution","volume":"Vol. 19","author":"Kirchherr","year":"1997","journal-title":"Math. Intelligence"},{"issue":"1","key":"10.1016\/S0004-3702(00)00034-5_ID015","first-page":"1","article-title":"Three approaches to the quantitative definition of information","volume":"Vol. 1","author":"Kolmogorov","year":"1965","journal-title":"Problems Inform. Transmission"},{"issue":"1","key":"10.1016\/S0004-3702(00)00034-5_ID016","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1147\/rd.311.0091","article-title":"Feature analysis for symbol recognition by elastic matching","volume":"Vol. 31","author":"Kurtzberg","year":"1987","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0004-3702(00)00034-5_ID017","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0022-0000(92)90026-F","article-title":"Inductive reasoning and Kolmogorov complexity","volume":"Vol. 44","author":"Li","year":"1992","journal-title":"J. Comput. Syst. Sci."},{"year":"1997","series-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"Li","key":"10.1016\/S0004-3702(00)00034-5_ID018"},{"issue":"3","key":"10.1016\/S0004-3702(00)00034-5_ID019","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1162\/neco.1992.4.3.448","article-title":"A practical Bayesian framework for backpropagation networks","volume":"Vol. 4","author":"MacKay","year":"1992","journal-title":"Neural Computation"},{"key":"10.1016\/S0004-3702(00)00034-5_ID020","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","article-title":"The definition of random sequences","volume":"Vol. 9","author":"Martin-L\u00f6f","year":"1966","journal-title":"Inform. Contr."},{"key":"10.1016\/S0004-3702(00)00034-5_ID021","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0890-5401(89)90010-2","article-title":"Inferring decision trees using the minimum description length principle","volume":"Vol. 80","author":"Quinlan","year":"1989","journal-title":"Inform. Computation"},{"key":"10.1016\/S0004-3702(00)00034-5_ID022","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","article-title":"Modeling by the shortest data description","volume":"Vol. 14","author":"Rissanen","year":"1978","journal-title":"Automatica-J.IFAC"},{"key":"10.1016\/S0004-3702(00)00034-5_ID023","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1109\/TIT.1984.1056936","article-title":"Universal coding, information, prediction and estimation","volume":"Vol. IT-30","author":"Rissanen","year":"1984","journal-title":"IEEE Trans. Inform. Theory"},{"year":"1989","series-title":"Stochastical Complexity and Statistical Inquiry","author":"Rissanen","key":"10.1016\/S0004-3702(00)00034-5_ID024"},{"key":"10.1016\/S0004-3702(00)00034-5_ID025","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1111\/j.2517-6161.1987.tb01694.x","article-title":"Stochastic complexity","volume":"Vol. 49","author":"Rissanen","year":"1987","journal-title":"J. Royal Stat. Soc., Series B"},{"key":"10.1016\/S0004-3702(00)00034-5_ID026","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","article-title":"A formal theory of inductive inference, Part 1 and Part 2","volume":"Vol. 7","author":"Solomonoff","year":"1964","journal-title":"Inform. Contr."},{"key":"10.1016\/S0004-3702(00)00034-5_ID027","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1109\/TIT.1978.1055913","article-title":"Complexity-based induction systems: Comparisons and convergence theorems","volume":"Vol. IT-24","author":"Solomonoff","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"10.1016\/S0004-3702(00)00034-5_ID028","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/PROC.1980.11675","article-title":"Automatic recognition of handprinted characters\u2014The state of art","volume":"Vol. 68","author":"Suen","year":"1980","journal-title":"Proc. IEEE"},{"issue":"6","key":"10.1016\/S0004-3702(00)00034-5_ID029","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1147\/rd.266.0765","article-title":"Cursive script recognition by elastic matching","volume":"Vol. 26","author":"Tapper","year":"1982","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0004-3702(00)00034-5_ID030","series-title":"Proc. European Symposium on Artificial Neural Networks, Brussels","article-title":"Model selection for neural networks: Comparing MDL and NIC","author":"te Brake","year":"1994"},{"key":"10.1016\/S0004-3702(00)00034-5_ID031","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1098\/rsta.1984.0069","article-title":"Deductive learning","volume":"Vol. 312","author":"Valiant","year":"1984","journal-title":"Phil. Trans. Royal Soc. London A"},{"key":"10.1016\/S0004-3702(00)00034-5_ID032","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"Vol. 27","author":"Valiant","year":"1984","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/S0004-3702(00)00034-5_ID033","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1109\/18.825807","article-title":"Minimum description length induction, Bayesianism, and Kolmogorov complexity","volume":"Vol. IT-46","author":"Vit\u00e1nyi","year":"2000","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0004-3702(00)00034-5_ID034","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/BF01203155","article-title":"Grundlagen der Wahrscheinlichkeitsrechnung","volume":"Vol. 5","author":"von Mises","year":"1919","journal-title":"Mathemat. Zeitsch."},{"key":"10.1016\/S0004-3702(00)00034-5_ID035","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1093\/comjnl\/11.2.185","article-title":"An information measure for classification","volume":"Vol. 11","author":"Wallace","year":"1968","journal-title":"Computer J."},{"key":"10.1016\/S0004-3702(00)00034-5_ID036","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1111\/j.2517-6161.1987.tb01695.x","article-title":"Estimation and inference by compact coding","volume":"Vol. 49","author":"Wallace","year":"1987","journal-title":"J. Roy. Statist. Soc."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370200000345?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370200000345?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T02:16:20Z","timestamp":1733278580000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370200000345"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,8]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,8]]}},"alternative-id":["S0004370200000345"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(00)00034-5","relation":{},"ISSN":["0004-3702"],"issn-type":[{"type":"print","value":"0004-3702"}],"subject":[],"published":{"date-parts":[[2000,8]]}}}