{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T23:47:41Z","timestamp":1772495261703,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540201212","type":"print"},{"value":"9783540398578","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39857-8_19","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T00:07:15Z","timestamp":1277683635000},"page":"193-204","source":"Crossref","is-referenced-by-count":2,"title":["Rademacher Penalization over Decision Tree Prunings"],"prefix":"10.1007","author":[{"given":"Matti","family":"K\u00e4\u00e4ri\u00e4inen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tapio","family":"Elomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"1902","DOI":"10.1109\/18.930926","volume":"47","author":"V. Koltchinskii","year":"2001","unstructured":"Koltchinskii, V.: Rademacher penalties and structural risk minimization. IEEE Trans. Inf. Theor.\u00a047, 1902\u20131914 (2001)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1162\/153244303321897690","volume":"3","author":"P.L. Bartlett","year":"2002","unstructured":"Bartlett, P.L., Mendelson, S.: Rademacher and Gaussian complexities: Risk bounds and structural results. JMLR\u00a03, 463\u2013482 (2002)","journal-title":"JMLR"},{"key":"19_CR3","volume-title":"Proc. 2nd ICSC Symposium on Neural Networks, NAISO","author":"F. Lozano","year":"2000","unstructured":"Lozano, F.: Model selection using Rademacher penalization. In: Proc. 2nd ICSC Symposium on Neural Networks, NAISO, Academic Press, London (2000)"},{"key":"19_CR4","first-page":"140","volume-title":"Proc. 18th National Conference on Artificial Intelligence","author":"T. Elomaa","year":"2002","unstructured":"Elomaa, T., K\u00e4\u00e4ri\u00e4inen, M.: Progressive Rademacher sampling. In: Proc. 18th National Conference on Artificial Intelligence, pp. 140\u2013145. MIT Press, Cambridge (2002)"},{"key":"19_CR5","first-page":"21","volume-title":"Proc. 12th International Conference on Machine Learning","author":"P. Auer","year":"1995","unstructured":"Auer, P., Holte, R.C., Maass, W.: Theory and application of agnostic PAC-learning with small decision trees. In: Proc. 12th International Conference on Machine Learning, pp. 21\u201329. Morgan Kaufmann, San Francisco (1995)"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1137\/S009753979630814X","volume":"30","author":"M. Grigni","year":"2000","unstructured":"Grigni, M., Mirelli, V., Papadimitriou, C.H.: On the difficulty of designing good classifiers. SIAM J. Comput.\u00a030, 318\u2013323 (2000)","journal-title":"SIAM J. Comput."},{"key":"19_CR7","volume-title":"C4.5: Programs for Machine Learning","author":"J.R. Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0020-7373(87)80053-6","volume":"27","author":"J.R. Quinlan","year":"1987","unstructured":"Quinlan, J.R.: Simplifying decision trees. Int. J. Man-Mach. Stud.\u00a027, 221\u2013248 (1987)","journal-title":"Int. J. Man-Mach. Stud."},{"key":"19_CR9","volume-title":"Estimation of Dependencies Based on Empirical Data","author":"V.N. Vapnik","year":"1982","unstructured":"Vapnik, V.N.: Estimation of Dependencies Based on Empirical Data. Springer, Heidelberg (1982)"},{"key":"19_CR10","volume-title":"Weak Convergence and Empirical Processes","author":"A.W. Vaart Van der","year":"2000","unstructured":"Van der Vaart, A.W., Wellner, J.A.: Weak Convergence and Empirical Processes. Springer, Heidelberg (2000) (corrected second printing)"},{"key":"19_CR11","series-title":"London Mathematical Society Lecture Note Series","first-page":"148","volume-title":"Surveys in Combinatorics","author":"C. McDiarmid","year":"1989","unstructured":"McDiarmid, C.: On the method of bounded differences. In: Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol.\u00a0141, pp. 148\u2013188. Cambridge University Press, Cambridge (1989)"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/A:1022604100933","volume":"4","author":"J. Mingers","year":"1989","unstructured":"Mingers, J.: An empirical comparison of pruning methods for decision tree induction. Mach. Learn.\u00a04, 227\u2013243 (1989)","journal-title":"Mach. Learn."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1109\/34.589207","volume":"19","author":"F. Esposito","year":"1997","unstructured":"Esposito, F., Malerba, D., Semeraro, G.: A comparative analysis of methods for pruning decision trees. IEEE Trans. Pattern Anal. Mach. Intell.\u00a019, 476\u2013491 (1997)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"19_CR14","first-page":"195","volume-title":"Proc. 14th International Conference on Machine Learning","author":"Y. Mansour","year":"1997","unstructured":"Mansour, Y.: Pessimistic decision tree pruning based on tree size. In: Proc. 14th International Conference on Machine Learning, pp. 195\u2013201. Morgan Kaufmann, San Francisco (1997)"},{"key":"19_CR15","first-page":"269","volume-title":"Proc. 15th International Conference on Machine Learning","author":"M. Kearns","year":"1998","unstructured":"Kearns, M., Mansour, Y.: A fast, bottom-up decision tree pruning algorithm with near-optimal generalization. In: Proc. 15th International Conference on Machine Learning, pp. 269\u2013277. Morgan Kaufmann, San Francisco (1998)"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/A:1007396710653","volume":"27","author":"D.P. Helmbold","year":"1997","unstructured":"Helmbold, D.P., Schapire, R.E.: Predicting nearly as well as the best pruning of a decision tree. Mach. Learn.\u00a027, 51\u201368 (1997)","journal-title":"Mach. Learn."},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/A:1007670818503","volume":"36","author":"F.C. Pereira","year":"1999","unstructured":"Pereira, F.C., Singer, Y.: An efficient extension to mixture techniques for prediction and decision trees. Mach. Learn.\u00a036, 183\u2013199 (1999)","journal-title":"Mach. Learn."},{"key":"19_CR18","first-page":"372","volume-title":"Proc. 16th National Conference on Artificial Intelligence","author":"T. Oates","year":"1999","unstructured":"Oates, T., Jensen, D.: Toward a theoretical understanding of why and when decision tree pruning algorithms fail. In: Proc. 16th National Conference on Artificial Intelligence, pp. 372\u2013378. MIT Press, Cambridge (1999)"},{"key":"19_CR19","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1613\/jair.816","volume":"15","author":"T. Elomaa","year":"2001","unstructured":"Elomaa, T., K\u00e4\u00e4ri\u00e4inen, M.: An analysis of reduced error pruning. J. Artif. Intell. Res.\u00a015, 163\u2013187 (2001)","journal-title":"J. Artif. Intell. Res."},{"key":"19_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/3-540-56602-3_135","volume-title":"Machine Learning: ECML-93","author":"F. Esposito","year":"1993","unstructured":"Esposito, F., Malerba, D., Semeraro, G.: Decision tree pruning as a search in the state space. In: Brazdil, P.B. (ed.) ECML 1993. LNCS (LNAI), vol.\u00a0667, pp. 165\u2013184. Springer, Heidelberg (1993)"},{"key":"19_CR21","volume-title":"Classification and Regression Trees","author":"L. Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth, Belmont (1984)"},{"key":"19_CR22","first-page":"223","volume":"15","author":"M. Bohanec","year":"1994","unstructured":"Bohanec, M., Bratko, I.: Trading accuracy for simplicity in decision trees. Mach. Learn.\u00a015, 223\u2013250 (1994)","journal-title":"Mach. Learn."},{"key":"19_CR23","first-page":"430","volume-title":"Proc. 12th International Conference on Machine Learning","author":"J.J. Oliver","year":"1995","unstructured":"Oliver, J.J., Hand, D.J.: On pruning and averaging decision trees. In: Proc. 12th International Conference on Machine Learning, pp. 430\u2013437. Morgan Kaufmann, San Francisco (1995)"},{"key":"19_CR24","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0004-3702(95)00060-7","volume":"83","author":"H. Almuallim","year":"1996","unstructured":"Almuallim, H.: An efficient algorithm for optimal pruning of decision trees. Artif. Intell.\u00a083, 347\u2013362 (1996)","journal-title":"Artif. Intell."},{"key":"19_CR25","first-page":"331","volume-title":"Proc. 19th International Conference on Machine Learning","author":"J. Langford","year":"2002","unstructured":"Langford, J.: Combining training set and test set bounds. In: Proc. 19th International Conference on Machine Learning, pp. 331\u2013338. Morgan Kaufmann, San Francisco (2002)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning: ECML 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39857-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:30:16Z","timestamp":1552609816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39857-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201212","9783540398578"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39857-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}