{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:47:12Z","timestamp":1725500832426},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540454854"},{"type":"electronic","value":"9783540454878"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11875581_119","type":"book-chapter","created":{"date-parts":[[2006,9,25]],"date-time":"2006-09-25T12:23:29Z","timestamp":1159187009000},"page":"995-1002","source":"Crossref","is-referenced-by-count":0,"title":["Evaluation of Decision Tree Pruning with Subadditive Penalties"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Garc\u00eda-Moratilla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo","family":"Mart\u00ednez-Mu\u00f1oz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Su\u00e1rez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"12","key":"119_CR1","doi-asserted-by":"publisher","first-page":"4518","DOI":"10.1109\/TSP.2005.859220","volume":"53","author":"C. Scott","year":"2005","unstructured":"Scott, C.: Tree pruning with subadditive penalties. IEEE Transactions on Signal Processing\u00a053(12), 4518\u20134525 (2005)","journal-title":"IEEE Transactions on Signal Processing"},{"key":"119_CR2","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. Chapman & Hall, New York (1984)"},{"key":"119_CR3","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)"},{"issue":"3","key":"119_CR4","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(3), 221\u2013234 (1987)","journal-title":"Int. J. Man-Mach. Stud."},{"issue":"5","key":"119_CR5","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., Kay, J.: A comparative analysis of methods for pruning decision trees. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a019(5), 476\u2013491 (1997)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"119_CR6","first-page":"69","volume-title":"COLT 2000: Proceedings of the Thirteenth Annual Conference on Computational Learning Theory","author":"Y. Mansour","year":"2000","unstructured":"Mansour, Y., McAllester, D.A.: Generalization bounds for decision trees. In: COLT 2000: Proceedings of the Thirteenth Annual Conference on Computational Learning Theory, pp. 69\u201374. Morgan Kaufmann Publishers Inc, San Francisco (2000)"},{"issue":"8","key":"119_CR7","doi-asserted-by":"publisher","first-page":"2362","DOI":"10.1109\/TIT.2002.800482","volume":"48","author":"A. Nobel","year":"2002","unstructured":"Nobel, A.: Analysis of a complexity-based pruning scheme for classification trees. IEEE Transactions on Information Theory\u00a048(8), 2362\u20132368 (2002)","journal-title":"IEEE Transactions on Information Theory"},{"key":"119_CR8","unstructured":"Scott, C., Nowak, R.: Dyadic classification trees via structural risk minimization. Advances in Neural Information Processing Systems 15 (2003)"},{"issue":"4","key":"119_CR9","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1109\/TIT.2006.871056","volume":"52","author":"C. Scott","year":"2006","unstructured":"Scott, C., Nowak, R.: Minimax-optimal classification with dyadic decision trees. IEEE Transactions on Information Theory\u00a052(4), 1335\u20131353 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"119_CR10","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. Machine Learning\u00a04(2), 227\u2013243 (1989)","journal-title":"Machine Learning"},{"key":"119_CR11","unstructured":"Blake, C.L., Merz, C.J.: UCI repository of machine learning databases (1998)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11875581_119.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:25:07Z","timestamp":1619508307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11875581_119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540454854","9783540454878"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11875581_119","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}