{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T07:19:45Z","timestamp":1778656785924,"version":"3.51.4"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":["Machine Learning"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1023\/a:1007396710653","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T04:48:21Z","timestamp":1040532501000},"page":"51-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":60,"title":["Predicting Nearly As Well As the Best Pruning of a Decision Tree"],"prefix":"10.1007","volume":"27","author":[{"given":"David P.","family":"Helmbold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert E.","family":"Schapire","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"130971_CR1","unstructured":"Breiman, Leo, Friedman, Jerome H., Olshen, Richard A. & Stone, Charles J. 1984 Classification and Regression Trees. Wadsworth International Group."},{"key":"130971_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01889584","volume":"2","author":"W. Buntine","year":"1992","unstructured":"Buntine, Wray. 1992. Learning classification trees. Statistics and Computing, 2:63-73.","journal-title":"Statistics and Computing"},{"key":"130971_CR3","unstructured":"Buntine, Wray Lindsay. 1990. A Theory of Learning Classification Rules. PhD thesis, University of Technology, Sydney, 1990."},{"key":"130971_CR4","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, Nicol\u00f2, Freund, Yoav, Helmbold, David P., Haussler, David, Schapire, Robert E., & Warmuth, Manfred K. 1993. How to use expert advice. In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, pages 382-391, 1993. To appear, Journal of the Association for Computing Machinery.","DOI":"10.1145\/167088.167198"},{"key":"130971_CR5","doi-asserted-by":"crossref","unstructured":"Freund, Yoav & Schapire, Robert E. 1995. A decision-theoretic generalization of on-line learning and an application to boosting. In Computational Learning Theory: Second European Conference, EuroCOLT'95, pages 23-37. Springer-Verlag. To appear, Journal of Computer and System Sciences.","DOI":"10.1007\/3-540-59119-2_166"},{"key":"130971_CR6","unstructured":"Hastie, Trevor & Pregibon, Daryl. 1990. Shrinking trees. Technical report, AT&T Bell Laboratories."},{"key":"130971_CR7","unstructured":"Kivinen, Jyrki & Warmuth, Manfred K. Using experts for predicting continuous outcomes. In Computational Learning Theory: EuroCOLT'93, pages 109-120. Springer-Verlag."},{"key":"130971_CR8","doi-asserted-by":"crossref","unstructured":"Kwok, Suk Wah & Carter, Chris. 1990. Multiple decision trees. In Ross D. Shachter, Tod S. Levitt, Laveen N. Kanal, and John F. Lemmer, editors, Uncertainty in Artificial Intelligence 4, pages 327-335. North-Holland.","DOI":"10.1016\/B978-0-444-88650-7.50030-5"},{"key":"130971_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1022869011914","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, Nick. 1988. Learning when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318.","journal-title":"Machine Learning"},{"key":"130971_CR10","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"Littlestone, Nick & Warmuth, Manfred K. 1994. The weighted majority algorithm. Information and Computation, 108:212-261.","journal-title":"Information and Computation"},{"key":"130971_CR11","doi-asserted-by":"crossref","unstructured":"Oliver, Jonathan J. & Hand, David. 1994. Averaging over decision stumps. In Machine Learning: ECML-94, pages 231-241. Springer-Verlag.","DOI":"10.1007\/3-540-57868-4_61"},{"key":"130971_CR12","doi-asserted-by":"crossref","unstructured":"Oliver, Jonathan J. & Hand David J. 1995. On pruning and averaging decision trees. In Proceedings of the Twelfth International Conference on Machine Learning, pages 430-437.","DOI":"10.1016\/B978-1-55860-377-6.50060-8"},{"key":"130971_CR13","unstructured":"Quinlan, J. Ross. 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann."},{"issue":"5","key":"130971_CR14","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1109\/TIT.1983.1056741","volume":"IT-29","author":"J. Rissanen","year":"1983","unstructured":"Rissanen, Jorma. 1983. A universal data compression system. IEEE Transactions on Information Theory, IT-29(5):656-664.","journal-title":"IEEE Transactions on Information Theory"},{"key":"130971_CR15","doi-asserted-by":"crossref","unstructured":"Ron, Dana, Singer, Yoram & Tishby, Naftali. 1994. Learning probabilistic automata with variable memory length. In Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, pages 35-46.","DOI":"10.1145\/180139.181006"},{"key":"130971_CR16","doi-asserted-by":"crossref","unstructured":"Vovk, Volodimir G. 1990. Aggregating strategies. In Proceedings of the Third Annual Workshop on Computational Learning Theory, pages 371-383.","DOI":"10.1016\/B978-1-55860-146-8.50032-1"},{"issue":"3","key":"130971_CR17","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.1109\/18.135641","volume":"38","author":"M. J. Weinberger","year":"1992","unstructured":"Weinberger, Marcelo J., Lempel, Abraham & Ziv, Jacob. 1992. A sequential algorithm for the universal coding of finite-memory sources. IEEE Transactions on Information Theory, 38(3):1002-1014.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"130971_CR18","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/18.312161","volume":"40","author":"M. J. Weinberger","year":"1994","unstructured":"Weinberger, Marcelo J., Merhav, Neri & Feder, Meir. 1994. Optimal sequential probability assignment for individual sequences. IEEE Transactions on Information Theory, 40(2):384-396.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"130971_CR19","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/18.382011","volume":"41","author":"M. J. Weinberger","year":"1995","unstructured":"Weinberger, Marcelo J., Rissanen, Jorma J. & Feder, Meir. 1995. A universal finite memory source. IEEE Transactions on Information Theory, 41(3):643-652.","journal-title":"IEEE Transactions on Information Theory"},{"key":"130971_CR20","doi-asserted-by":"crossref","unstructured":"Willems, Frans M. J., Shtarkov, Yuri M. & Tjalkens, Tjalling J. 1993. Context tree weighting: a sequential universal source coding procedure for FSMX sources. In Proceedings 1993 IEEE International Symposium on Information Theory, page 59.","DOI":"10.1109\/ISIT.1993.748374"},{"issue":"3","key":"130971_CR21","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1109\/18.382012","volume":"41","author":"F. M. J. Willems","year":"1995","unstructured":"Willems, Frans M. J., Shtarkov, Yuri M. & Tjalkens, Tjalling J. 1995. The context tree weighting method: basic properties. IEEE Transactions on Information Theory, 41(3):653-664.","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007396710653.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007396710653\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007396710653.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:45:27Z","timestamp":1752147927000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007396710653"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["130971"],"URL":"https:\/\/doi.org\/10.1023\/a:1007396710653","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,4]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}