{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:09:00Z","timestamp":1766441340997},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425816"},{"type":"electronic","value":"9783540448167"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44816-0_21","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:38:51Z","timestamp":1184603931000},"page":"208-217","source":"Crossref","is-referenced-by-count":8,"title":["An Empirical Comparison of Pruning Methods for Ensemble Classifiers"],"prefix":"10.1007","author":[{"given":"Terry","family":"Windeatt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gholamreza","family":"Ardeshir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,3]]},"reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1023\/A:1007515423169","volume":"36","author":"E. Bauer","year":"1999","unstructured":"E. Bauer and R. Kohavi. An empirical comparison of voting classification algorithms: Bagging, boosting, and variants. Maching Learning, 36(1):105\u2013142, 1999.","journal-title":"Maching Learning"},{"issue":"2","key":"21_CR2","first-page":"123","volume":"26","author":"L. Breiman","year":"1996","unstructured":"Leo Breiman. Bagging predictors. Machine Learning, 26(2):123\u2013140, 1996.","journal-title":"Machine Learning"},{"key":"21_CR3","unstructured":"Leo Breiman. Some infinity theory for predictor ensembles. Technical report, TR 577, Department of Statistics, University of California, Berkeley, 2000"},{"key":"21_CR4","unstructured":"Leo Breiman, J. H. Freidman, R. A. Olshen, and C.J. Stone. Classification and regression trees. Wadsworth International Group, 1984. \n                    ftp:\/\/ftp.stat.berkeley.edu\/pub\/users\/breiman\n                    \n                  ."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"L. A. Breslow and D. W. Aha. Simplifying decision trees: A survey. Knowledge Engineering Review, pages 1\u201340, 1997.","DOI":"10.1017\/S0269888997000015"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"B. Cestnik and I. Bratko. On estimating probabilities in tree pruning. In Kodratoff Y., editor, Machine Learning-EWSL-91.European Working Session on Learning Proceedings, pages 138-50. Springer-Verlag, 1991.","DOI":"10.1007\/BFb0017010"},{"key":"21_CR7","unstructured":"T. G. Dietterich D. Margineantu. Pruning adaptive boosting. In International Conference on Machine Learning, pages 211\u2013218. Morgan Kaufmann, 1997."},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"1895","DOI":"10.1162\/089976698300017197","volume":"10","author":"T. G. Detterich","year":"1998","unstructured":"Thomas G. Detterich. Approximate statistical tests for comparing supervised classification learning algorithms. Neural Computation, 10:1895\u20131923, 1998.","journal-title":"Neural Computation"},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1007607513941","volume":"40","author":"T. G. Dietterich","year":"2000","unstructured":"T. G. Dietterich. An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. Machine Learning, 40(2):139\u2013158, 2000.","journal-title":"Machine Learning"},{"issue":"5","key":"21_CR10","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1109\/34.589207","volume":"19","author":"F. Esposito","year":"1997","unstructured":"F. Esposito, D. Malerba, and G. Semeraro. A comparative analysis of methods for pruning decision trees. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(5):476\u2013491, May 1997.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"21_CR11","unstructured":"Y. Freund and R. Schapire. Experiments with a new boosting algorithm. Machine Learning:Proceedings of the Thirteenth International Conference, pages 148\u2013156, 1996."},{"key":"21_CR12","unstructured":"G. James. Majority Vote Classifiers: Theory and Applications. PhD thesis, Dept. of Statistics, Univ. of Stanford, May 1998. \n                    http:\/\/www-stat.stanford.edu\/ gareth\/\n                    \n                  ."},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.2307\/2582520","volume":"38","author":"J. Mingers","year":"1987","unstructured":"J. Mingers. Expert systems-rule induction with statistical data. Operational Research Society, 38:39\u201347, 1987.","journal-title":"Operational Research Society"},{"key":"21_CR14","unstructured":"T. Niblett and I. Bratko. Learning decision rules in noisy domains. In Expert System 86, Cambridge. Cambridge University Press, 1986."},{"key":"21_CR15","unstructured":"J. Ross Quinlan. Personal communication from Quinlan."},{"key":"21_CR16","unstructured":"J. Ross Quinlan. Bagging, boosting, and c4.5. In Fourteenth National Conference on Artificial Intelligence, 1996."},{"key":"21_CR17","first-page":"81","volume":"1","author":"R. Quinlan","year":"1986","unstructured":"R. Quinlan. Induction of decision tree. Machine Learning, 1:81\u2013106, 1986.","journal-title":"Machine Learning"},{"key":"21_CR18","volume-title":"C4.5: Programs for Machine Learning","author":"R. Quinlan","year":"1993","unstructured":"R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, California, 1993."},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0020-7373(87)80053-6","volume":"27","author":"R.J. Quinlan","year":"1987","unstructured":"R.J. Quinlan. Simplyfying decision trees. International Journal of Man-Machine Studies, 27:221\u2013234, 1987.","journal-title":"International Journal of Man-Machine Studies"},{"key":"21_CR20","unstructured":"http:\/\/www.cse.unsw.edu.au~quinlan\n                    \n                  ."},{"key":"21_CR21","unstructured":"These datasets can be found on: \n                    http:\/\/www.ics.uci.edu\/mlearn\/MLSummary.html\n                    \n                  ."},{"key":"21_CR22","unstructured":"P. E. Utgoff and C. E. Brodley. Linear machine decision trees. Technical report, Department of Computer Science, University of Massachusetts, Amhers, 1991."},{"key":"21_CR23","unstructured":"T. Windeatt and G. Ardeshir. Boosting unpruned and pruned decision trees. In Applied Informatics, Preceedings of the IASTED International Symposia, pages 66\u201371, 2001."},{"issue":"2","key":"21_CR24","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S1566-2535(01)00029-X","volume":"2","author":"T. Windeatt","year":"2001","unstructured":"T. Windeatt and R. Ghaderi. Binary labelling and decision level fusion. Information fusion, 2(2):103\u2013112, 2001.","journal-title":"Information fusion"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44816-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T01:07:54Z","timestamp":1550452074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44816-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425816","9783540448167"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-44816-0_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}