{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:16:05Z","timestamp":1743149765993,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428756"},{"type":"electronic","value":"9783540455837"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","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":[[2001]]},"DOI":"10.1007\/3-540-45583-3_8","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:37:04Z","timestamp":1192783024000},"page":"77-91","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Simpler Analysis of the Multi-way Branching Decision Tree Boosting Algorithm"],"prefix":"10.1007","author":[{"given":"Kohei","family":"Hatano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0020-0190(87)90114-1","volume":"24","author":"A. Blumer","year":"1987","unstructured":"A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Occam\u2019s razor. Information Processing Letters, 24:377\u2013380, April 1987.","journal-title":"Information Processing Letters"},{"key":"8_CR2","unstructured":"L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Wadsworth International Group, 1984."},{"key":"8_CR3","unstructured":"Carlos Domingo and Osamu Watanabe. MadaBoost: A modification of AdaBoost. In Proceedings of 13th Annual Conference on Computational Learning Theory, pages 180\u2013189. Morgan Kaufmann, San Francisco, 2000."},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1006\/inco.1995.1136","volume":"121","author":"Y. Freund","year":"1995","unstructured":"Y. Freund. Boosting a weak learning algorithm by majority. Information and Computation, 121(2):256\u2013285, September 1995.","journal-title":"Information and Computation"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Yoav Freund and Robert E. Schapire:. A decision-theoretic generalization of online learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119\u2013139, 1997.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/jcss.1997.1543","volume":"58","author":"M. Kearns","year":"1999","unstructured":"M. Kearns and Y. Mansour. On the boosting ability of top-down decision tree learning algorithms. Journal of Computer and System Sciences, 58(1):109\u2013128, 1999.","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR7","first-page":"300","volume":"12","author":"Y. Mansour","year":"2000","unstructured":"Y. Mansour and D. McAllester. Boosting with multi-way branching in decision trees. In Advances in Neural Information Processing Systems, volume 12, pages 300\u2013306. The MIT Press, 2000.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"8_CR8","unstructured":"J. Ross Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993."},{"issue":"2","key":"8_CR9","first-page":"197","volume":"5","author":"R. E. Schapire","year":"1990","unstructured":"Robert E. Schapire. The strength of weak learnability. Machine Learning, 5(2):197\u2013227, 1990.","journal-title":"Machine Learning"},{"key":"8_CR10","unstructured":"Robert E. Schapire. Using output codes to boost multiclass learning problems. In Proc. 14th International Conference on Machine Learning, pages 313\u2013321. Morgan Kaufmann, 1997."},{"issue":"3","key":"8_CR11","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1007614523901","volume":"37","author":"R. E. Schapire","year":"1999","unstructured":"Robert E. Schapire and Yoram Singer. Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37(3):297\u2013336, 1999.","journal-title":"Machine Learning"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Eiji Takimoto and Akira Maruoka. On the boosting algorithm for multiclass functions based on information-theoretic criterion for approximation. In Proceedings of the 1st International Conference on Discovery Science, volume 1532 of Lecture Notes in Artificial Intelligence, pages 256\u2013267. Springer-Verlag, 1998.","DOI":"10.1007\/3-540-49292-5_23"},{"issue":"11","key":"8_CR13","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1984","unstructured":"L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134\u20131142, November 1984.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45583-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T01:03:19Z","timestamp":1585616599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45583-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428756","9783540455837"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45583-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"31 October 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}