{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:24:31Z","timestamp":1759134271047},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221449"},{"type":"electronic","value":"9783540259664"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25966-4_22","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T21:54:01Z","timestamp":1284155641000},"page":"223-232","source":"Crossref","is-referenced-by-count":25,"title":["A Comparison of Ensemble Creation Techniques"],"prefix":"10.1007","author":[{"given":"Robert E.","family":"Banfield","sequence":"first","affiliation":[]},{"given":"Lawrence O.","family":"Hall","sequence":"additional","affiliation":[]},{"given":"Kevin W.","family":"Bowyer","sequence":"additional","affiliation":[]},{"given":"Divya","family":"Bhadoria","sequence":"additional","affiliation":[]},{"given":"W. Philip","family":"Kegelmeyer","sequence":"additional","affiliation":[]},{"given":"Steven","family":"Eschrich","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","first-page":"123","volume":"24","author":"L. Breiman","year":"1996","unstructured":"Breiman, L.: Bagging predictors. Machine Learning\u00a024, 123\u2013140 (1996)","journal-title":"Machine Learning"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Eibl, G., Pfeiffer, K.P.: How to make AdaBoost.M1 work for weak base classifiers by changing only one line of the code. In: Proceedings of the Thirteenth European Conference on Machine Learning, pp. 72\u201383 (2002)","DOI":"10.1007\/3-540-36755-1_7"},{"key":"22_CR3","unstructured":"Collins, M., Schapire, R.E., Singer, Y.: Logistic regression, AdaBoost and Bregman distances. In: Proceedings of the Thirteenth Annual Conference on Computational Learning Theory, pp. 158\u2013169 (2000)"},{"issue":"2","key":"22_CR4","first-page":"197","volume":"5","author":"R.E. Schapire","year":"1990","unstructured":"Schapire, R.E.: The strength of weak learnability. Machine Learning\u00a05(2), 197\u2013227 (1990)","journal-title":"Machine Learning"},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L. Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Machine Learning\u00a045(1), 5\u201332 (2001)","journal-title":"Machine Learning"},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1007607513941","volume":"40","author":"T.G. Dietterich","year":"2000","unstructured":"Dietterich, T.G.: An experimental comparison of three methods for constructing ensembles of decision trees: bagging, boosting, and randomization. Machine Learning\u00a040(2), 139\u2013157 (2000)","journal-title":"Machine Learning"},{"issue":"8","key":"22_CR7","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1109\/34.709601","volume":"20","author":"T.K. Ho","year":"1998","unstructured":"Ho, T.K.: The random subspace method for constructing decision forests. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a020(8), 832\u2013844 (1998)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"22_CR8","first-page":"673","volume-title":"Advances in Neural Information Processing Systems","author":"G. Hulten","year":"2002","unstructured":"Hulten, G., Domingos, P.: Learning from infinite data in finite time. In: Advances in Neural Information Processing Systems, vol.\u00a014, pp. 673\u2013680. MIT Press, Cambridge (2002)"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Bowyer, K.W., Chawla Jr., N.V., Moore, T.E., Hall, L.O., Kegelmeyer, W.P.: A parallel decision tree builder for mining very large visualization datasets. In: IEEE Systems, Man, and Cybernetics Conference, pp. 1888\u20131893 (2000)","DOI":"10.1109\/ICSMC.2000.886388"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/S0167-8655(02)00269-6","volume":"24","author":"N.V. Chawla","year":"2003","unstructured":"Chawla, N.V., Moore, T.E., Hall, L.O., Bowyer, K.W., Kegelmeyer, W.P., Springer, C.: Distributed learning with bagging-like performance. Pattern Recognition Letters\u00a024, 455\u2013471 (2003)","journal-title":"Pattern Recognition Letters"},{"key":"22_CR11","unstructured":"Merz, C.J., Murphy, P.M.: UCI Repository of Machine Learning Databases. Univ. of CA., Dept. of CIS, Irvine, CA, \n                    \n                      http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"22_CR12","unstructured":"Banfield, R.: The OpenDT project. Technical report, University of South Florida (2003), \n                    \n                      http:\/\/www.csee.usf.edu\/~rbanfiel\/OpenDT.html"},{"key":"22_CR13","volume-title":"C4.5: Programs for Machine Learning","author":"J.R. Quinlan","year":"1992","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1992)"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Hall, L.O., Bowyer, K.W., Banfield, R.E., Bhadoria, D., Kegelmeyer, W.P., Eschrich, S.: Comparing pure parallel ensemble creation techniques against bagging. In: The Third IEEE International Conference on Data Mining, pp. 533\u2013536 (2003)","DOI":"10.1109\/ICDM.2003.1250970"},{"key":"22_CR15","unstructured":"Brazdil, P., Gama, J.: The statlog project-evaluation\/characterization of classification algorithms. Technical report, The STATLOG Project-Evaluation\/Characterization of Classification Algorithms (1998), \n                    \n                      http:\/\/www.ncc.up.pt\/liacc\/ML\/statlog\/"},{"key":"22_CR16","volume-title":"Classification and Regression Trees","author":"L. Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J.H., Olshen, R.A., Stone, P.J.: Classification and Regression Trees. Wadsworth International Group, Belmont (1984)"},{"key":"22_CR17","volume-title":"Data Mining: Practical machine learning tools with Java implementations","author":"I.H. Witten","year":"1999","unstructured":"Witten, I.H., Frank, E.: Data Mining: Practical machine learning tools with Java implementations. Morgan Kaufmann, San Francisco (1999)"},{"key":"22_CR18","unstructured":"de Borda, J.C.: Memoire sur les elections au scrutin. Historie de l\u00c1cademie Royale des Sciences, Paris (1781)"},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/s100440200009","volume":"5","author":"T.K. Ho","year":"2002","unstructured":"Ho, T.K.: A data complexity analysis of comparative advantages of decision forest constructors. Pattern Analysis and Applications\u00a05, 102\u2013112 (2002)","journal-title":"Pattern Analysis and Applications"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Banfield, R.E., Hall, L.O., Bowyer, K.W., Kegelmeyer, W.P.: A new ensemble diversity measure applied to thinning ensembles. In: Multiple Classifier Systems Conference, June 2003, pp. 306\u2013316 (2003)","DOI":"10.1007\/3-540-44938-8_31"}],"container-title":["Lecture Notes in Computer Science","Multiple Classifier Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25966-4_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:20:01Z","timestamp":1619997601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25966-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221449","9783540259664"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25966-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}