{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T11:04:43Z","timestamp":1774263883310,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,12,21]],"date-time":"2010-12-21T00:00:00Z","timestamp":1292889600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artif Intell Rev"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s10462-010-9192-8","type":"journal-article","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T11:19:21Z","timestamp":1292843961000},"page":"223-240","source":"Crossref","is-referenced-by-count":125,"title":["Combining bagging, boosting, rotation forest and random subspace methods"],"prefix":"10.1007","volume":"35","author":[{"given":"Sotiris","family":"Kotsiantis","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,12,21]]},"reference":[{"key":"9192_CR1","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1023\/A:1007515423169","volume":"36","author":"E Bauer","year":"1999","unstructured":"Bauer E, Kohavi R (1999) An empirical comparison of voting classification algorithms: bagging, boosting, and variants. Mach Learn 36: 105\u2013139","journal-title":"Mach Learn"},{"key":"9192_CR2","doi-asserted-by":"crossref","unstructured":"Bosch A, Daelemans W (1999) Memory-based morphological analysis. In: Proceedings of 37th annual meeting of the ACL. University of Maryland, pp 285\u2013292 ( http:\/\/ilk.kub.nl\/~antalb\/ltuia\/week10.html )","DOI":"10.3115\/1034678.1034726"},{"issue":"3","key":"9192_CR3","first-page":"123","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman L (1996) Bagging predictors. Mach Learn 24(3): 123\u2013140","journal-title":"Mach Learn"},{"issue":"1","key":"9192_CR4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L (2001) Random forests. Mach Learn 45(1): 5\u201332","journal-title":"Mach Learn"},{"key":"9192_CR5","doi-asserted-by":"crossref","first-page":"1291","DOI":"10.1016\/S0031-3203(02)00121-8","volume":"36","author":"R Bryll","year":"2003","unstructured":"Bryll R, Gutierrez-Osuna R, Quek F (2003) Attribute bagging: improving accuracy of classifier ensemble by using random feature subsets. Pattern Recognit 36: 1291\u20131302","journal-title":"Pattern Recognit"},{"key":"9192_CR6","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1214\/aos\/1031689014","volume":"30","author":"P B\u00fchlman","year":"2002","unstructured":"B\u00fchlman P, Yu B (2002) Analyzing bagging. Ann Stat 30: 927\u2013961","journal-title":"Ann Stat"},{"key":"9192_CR7","first-page":"323","volume":"16","author":"WS Buja","year":"2006","unstructured":"Buja WS (2006) Observations on bagging. Statistica Sinica 16: 323\u2013351","journal-title":"Statistica Sinica"},{"key":"9192_CR8","unstructured":"Cai Q-T, Peng C-Y, Zhang C-S (2008) A weighted subspace approach for improving bagging performance. In: IEEE ICASSP, pp 3341\u20133344"},{"key":"9192_CR9","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1023\/A:1007607513941","volume":"40","author":"T Dietterich","year":"2000","unstructured":"Dietterich T (2000) An experimental comparison of three methods for constructing ensembles of decision trees: bagging, boosting, and randomization. Mach Learn 40: 139\u2013157","journal-title":"Mach Learn"},{"key":"9192_CR10","unstructured":"Dietterich TG (2001) Ensemble methods in machine learning. In: Kittler J, Roli F (eds) Multiple classifier systems. LNCS, vol 1857, pp 1\u201315"},{"key":"9192_CR11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/A:1007413511361","volume":"29","author":"P Domingos","year":"1997","unstructured":"Domingos P, Pazzani M (1997) On the optimality of the simple Bayesian classifier under zero-one loss. Mach Learn 29: 103\u2013130","journal-title":"Mach Learn"},{"key":"9192_CR12","unstructured":"Frank E, Witten IH (1998) Generating Accurate Rule Sets Without Global Optimization. In: Fifteenth international conference on machine learning, pp 144\u2013151"},{"key":"9192_CR13","unstructured":"Frank A, Asuncion A (2010) UCI machine learning repository [ http:\/\/www.archive.ics.uci.edu\/ml ]. Irvine, CA: University of California, School of Information and Computer Science"},{"issue":"3","key":"9192_CR14","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1016\/j.jspi.2006.06.002","volume":"137","author":"JH Freidman","year":"2007","unstructured":"Freidman JH, Hall P (2007) On bagging and nonlinear estimation. J Stat Plan Inference 137(3): 669\u2013683","journal-title":"J Stat Plan Inference"},{"key":"9192_CR15","first-page":"307","volume":"28","author":"J Freidman","year":"2000","unstructured":"Freidman J, Hastie T, Tibshirani R (2000) Additive logistic regression: a statistical view of boosting. Ann Stat 28: 307\u2013337","journal-title":"Ann Stat"},{"key":"9192_CR16","unstructured":"Freund Y, Robert E Schapire (1996) Experiments with a new boosting algorithm. In: Proceedings of ICML\u201996, pp 148\u2013156"},{"issue":"1","key":"9192_CR17","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"Freund Y, Schapire RE (1997) A decision-theoretic generalization of on-line learning and an application to boosting. J Comput Syst Sci 55(1): 119\u2013139","journal-title":"J Comput Syst Sci"},{"key":"9192_CR18","doi-asserted-by":"crossref","unstructured":"Fumera G, Roli F, Serrau A (2005) Dynamics of variance reduction in bagging and other techniques based on randomisation. MCS 2005, LNCS vol 3541, pp 316\u2013325","DOI":"10.1007\/11494683_32"},{"issue":"7","key":"9192_CR19","doi-asserted-by":"crossref","first-page":"1293","DOI":"10.1109\/TPAMI.2008.30","volume":"30","author":"G Fumera","year":"2008","unstructured":"Fumera G, Roli F, Serrau A (2008) A theoretical analysis of bagging as a linear combination of classifiers. IEEE Trans Pattern Anal Mach Intell 30(7):1293\u20131299","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"9192_CR20","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1016\/j.neunet.2007.12.046","volume":"21","author":"N Garc\u0131a-Pedrajas","year":"2008","unstructured":"Garc\u0131a-Pedrajas N, Ortiz-Boyer D (2008) Boosting random subspace method. Neural Netw 21: 1344\u20131362","journal-title":"Neural Netw"},{"key":"9192_CR21","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1023\/B:MACH.0000027783.34431.42","volume":"55","author":"Y Grandvalet","year":"2004","unstructured":"Grandvalet Y (2004) Bagging equalizes influence. Mach Learn 55: 251\u2013270","journal-title":"Mach Learn"},{"issue":"8","key":"9192_CR22","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1109\/34.709601","volume":"20","author":"TK Ho","year":"1998","unstructured":"Ho TK (1998) The random subspace method for constructing decision forests. IEEE Trans Pattern Anal Mach Intell 20(8): 832\u2013844","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"9192_CR23","unstructured":"Kotsiantis S, Pierrakeas C, Pintelas P (2003) Preventing student dropout in distance learning systems using machine learning techniques. In: Proceedings of 7th international conference on knowledge-based intelligent information and engineering systems (KES), Oxford, Sept. 3\u20135, Lecture notes series, vol 2774. Springer, pp 267\u2013274"},{"key":"9192_CR24","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S1566-2535(02)00093-3","volume":"3","author":"LI Kuncheva","year":"2002","unstructured":"Kuncheva LI, Skurichina M, Duin RPW (2002) An experimental study on diversity for bagging and boosting with linear classifiers. Inf Fusion 3: 245\u2013258","journal-title":"Inf Fusion"},{"key":"9192_CR25","unstructured":"Latinne P, Debeir O, Decaestecker Ch (2000) Mixing bagging and multiple feature subsets to improve classification accuracy of decision tree combination. In: Proceedings of the 10th Belgian-Dutch conference on machine learning, Tilburg University"},{"key":"9192_CR26","unstructured":"Melville P, Mooney R (2003) Constructing diverse classifier ensembles using artificial training examples. In: Proceedings of IJCAI-2003, pp 505\u2013510, Acapulco, Mexico, August 2003"},{"key":"9192_CR27","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1023\/A:1009744630224","volume":"2","author":"Murthy","year":"1998","unstructured":"Murthy RPW (1998) Automatic construction of decision trees from data: a multi-disciplinary survey. Data Min Knowl Discov 2: 345\u2013389","journal-title":"Data Min Knowl Discov"},{"key":"9192_CR28","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1613\/jair.614","volume":"11","author":"D Opitz","year":"1999","unstructured":"Opitz D, Maclin R (1999) Popular ensemble methods: an empirical study. Artif Intell Res 11: 169\u2013198","journal-title":"Artif Intell Res"},{"key":"9192_CR29","doi-asserted-by":"crossref","unstructured":"Panov P, Dzeroski S (2007) Combining bagging and random subspaces to create better ensembles, IDA 2007, LNCS 4723, pp 118\u2013129","DOI":"10.1007\/978-3-540-74825-0_11"},{"key":"9192_CR30","unstructured":"Redpath DB, Lebart K (2005) Boosting feature selection. In: The third international conference on advances in pattern recognition, Bath, UK, Springer, Berlin, pp 305\u2013314"},{"issue":"10","key":"9192_CR31","doi-asserted-by":"crossref","first-page":"1619","DOI":"10.1109\/TPAMI.2006.211","volume":"28","author":"JJ Rodr\u00edguez","year":"2006","unstructured":"Rodr\u00edguez JJ, Kuncheva LI, Alonso CJ (2006) Rotation forest: a new classifier ensemble method. IEEE Trans Pattern Anal Mach Intell 28(10): 1619\u20131630","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"9192_CR32","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1023\/A:1009752403260","volume":"1","author":"S Salzberg","year":"1997","unstructured":"Salzberg S (1997) On comparing classifiers: pitfalls to avoid and a recommended approach. Data Min Knowl Discov 1: 317\u2013328","journal-title":"Data Min Knowl Discov"},{"key":"9192_CR33","doi-asserted-by":"crossref","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"RE Schapire","year":"1998","unstructured":"Schapire RE, Freund Y, Bartlett P, Lee WS (1998) Boosting the margin: a new explanation for the effectiveness of voting methods. Ann Stat 26: 1651\u20131686","journal-title":"Ann Stat"},{"key":"9192_CR34","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1023\/A:1007614523901","volume":"37","author":"RE Schapire","year":"1999","unstructured":"Schapire RE, Singer Y (1999) Improved boosting algorithms using confidence-rated predictions. Mach Learn 37: 297\u2013336","journal-title":"Mach Learn"},{"key":"9192_CR35","doi-asserted-by":"crossref","unstructured":"Shirai S, Kudo M, Nakamura A (2008) Bagging, random subspace method and biding. SSPR&SPR 2008, LNCS vol 5342, pp 801\u2013810","DOI":"10.1007\/978-3-540-89689-0_84"},{"key":"9192_CR36","doi-asserted-by":"crossref","unstructured":"Stefanowski J (2007) Combining answers of sub-classifiers in the bagging-feature ensembles, RSEISP 2007, LNAI vol 4585, pp 574\u2013583","DOI":"10.1007\/978-3-540-73451-2_60"},{"key":"9192_CR37","unstructured":"Ting KM, Witten IH (1997) Stacking bagged and dagged models. In: Fourteenth international conference on machine learning, San Francisco, CA, pp 367\u2013375"},{"key":"9192_CR38","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/A:1007659514849","volume":"40","author":"GI Webb","year":"2000","unstructured":"Webb GI (2000) MultiBoosting: a technique for combining boosting and wagging. Mach Learn 40: 159\u2013196","journal-title":"Mach Learn"},{"key":"9192_CR39","doi-asserted-by":"crossref","first-page":"2195","DOI":"10.1016\/j.patrec.2005.03.029","volume":"26","author":"X-C Yin","year":"2005","unstructured":"Yin X-C, Liu C-P, Zhi H (2005) Feature combination using boosting. Pattern Recognit Lett 26: 2195\u20132205","journal-title":"Pattern Recognit Lett"}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-010-9192-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10462-010-9192-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-010-9192-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T23:47:09Z","timestamp":1740786429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10462-010-9192-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,21]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["9192"],"URL":"https:\/\/doi.org\/10.1007\/s10462-010-9192-8","relation":{},"ISSN":["0269-2821","1573-7462"],"issn-type":[{"value":"0269-2821","type":"print"},{"value":"1573-7462","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,21]]}}}