{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:10:33Z","timestamp":1759626633681,"version":"build-2065373602"},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4429,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s0304-3975(00)00138-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:37:27Z","timestamp":1027607847000},"page":"179-209","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"title":["Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme"],"prefix":"10.1016","volume":"261","author":[{"given":"Eiji","family":"Takimoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Maruoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Volodya","family":"Vovk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"doi-asserted-by":"crossref","unstructured":"A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour, S. Rudich, Weakly learning DNF and characterizing statistical query learning using Fourier analysis, Proc. 26th STOC, 1994, pp. 253\u2013262.","key":"10.1016\/S0304-3975(00)00138-9_BIB1","DOI":"10.1145\/195058.195147"},{"key":"10.1016\/S0304-3975(00)00138-9_BIB2","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1006\/inco.1995.1164","article-title":"Exact learning via the monotone theory","volume":"123","author":"Bshouty","year":"1995","journal-title":"Inform. and Comput."},{"issue":"3","key":"10.1016\/S0304-3975(00)00138-9_BIB3","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/258128.258179","article-title":"How to use expert advice","volume":"44","author":"Cesa-Bianchi","year":"1997","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(00)00138-9_BIB4","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1109\/18.485708","article-title":"Universal portfolios with side information","volume":"42","author":"Cover","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(00)00138-9_BIB5","series-title":"Proc. 29th FOCS","first-page":"110","article-title":"Learning probabilistic prediction functions","author":"DeSantis","year":"1988"},{"key":"10.1016\/S0304-3975(00)00138-9_BIB6","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jcss.1997.1504","article-title":"A decision-theoretic generalization of on-line learning and an application to boosting","volume":"55","author":"Freund","year":"1997","journal-title":"J. Comput. System Sci."},{"doi-asserted-by":"crossref","unstructured":"Y. Freund, R. Schapire, Y. Singer, M. Warmuth, Using and combining predictors that specialize, Proc. 29th STOC, 1997.","key":"10.1016\/S0304-3975(00)00138-9_BIB7","DOI":"10.1145\/258533.258616"},{"doi-asserted-by":"crossref","unstructured":"D. Haussler, J. Kivinen, M.K. Warmuth, Tight worst-case loss bounds for predicting with expert advice, Tech. Rep. UCSC-CRL-94-36, University of California, Santa Cruz, CA, revised December 1994. Short version in: P. Vit\u00e1nyi (Ed.), Computational Learning Theory, Lecture Notes in Computer Science, vol. 904, Springer, Berlin, 1995.","key":"10.1016\/S0304-3975(00)00138-9_BIB8","DOI":"10.1007\/3-540-59119-2_169"},{"key":"10.1016\/S0304-3975(00)00138-9_BIB9","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1023\/A:1007396710653","article-title":"Predicting nearly as well as the best pruning of a decision tree","volume":"27","author":"Helmbold","year":"1997","journal-title":"Mach. Learning"},{"doi-asserted-by":"crossref","unstructured":"M. Kearns, Y. Mansour, On the boosting ability of top-down decision tree learning algorithms, Proc. 28th STOC, 1996, pp. 459\u2013468.","key":"10.1016\/S0304-3975(00)00138-9_BIB10","DOI":"10.1145\/237814.237994"},{"key":"10.1016\/S0304-3975(00)00138-9_BIB11","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1023\/A:1022869011914","article-title":"Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm","volume":"2","author":"Littlestone","year":"1988","journal-title":"Mach. Learning"},{"key":"10.1016\/S0304-3975(00)00138-9_BIB12","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1006\/inco.1994.1009","article-title":"The weighted majority algorithm","volume":"108","author":"Littlestone","year":"1994","journal-title":"Inform. and Comput."},{"doi-asserted-by":"crossref","unstructured":"F. Pereira, Y. Singer, An efficient extension to mixture techniques for prediction and decision trees, in: Proc. 10th COLT, Assoc. Comput. Mach. New York, 1997, pp. 114\u2013121.","key":"10.1016\/S0304-3975(00)00138-9_BIB13","DOI":"10.1145\/267460.267487"},{"year":"1993","author":"Quinlan","series-title":"C4.5: Programs for Machine Learning","key":"10.1016\/S0304-3975(00)00138-9_BIB14"},{"key":"10.1016\/S0304-3975(00)00138-9_BIB15","first-page":"385","article-title":"A simple algorithm for predicting nearly as well as the best pruning labeled with the best prediction values of a decision tree","volume":"vol. 1316","author":"Takimoto","year":"1997"},{"key":"10.1016\/S0304-3975(00)00138-9_BIB16","series-title":"Proc. 3rd COLT","first-page":"371","article-title":"Aggregating strategies","author":"Vovk","year":"1990"},{"key":"10.1016\/S0304-3975(00)00138-9_BIB17","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0890-5401(92)90050-P","article-title":"Universal forecasting algorithms","volume":"96","author":"Vovk","year":"1992","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00138-9_BIB18","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1006\/jcss.1997.1556","article-title":"A game of prediction with expert advice","volume":"56","author":"Vovk","year":"1998","journal-title":"J. Comput. System Sci."},{"doi-asserted-by":"crossref","unstructured":"V. Vovk, Derandomizing stochastic prediction strategies, in: Proc. 9th COLT, Assoc. Comput. Mach., New York, 1997, pp. 32\u201344. Mach. Learning, 35 (1999) 247\u2013282.","key":"10.1016\/S0304-3975(00)00138-9_BIB19","DOI":"10.1023\/A:1007595032382"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001389?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001389?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:03Z","timestamp":1759625523000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001389"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0304397500001389"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00138-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2001,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(00)00138-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}