Highly parallel computing, 1989. ,
An Empirical Comparison of Supervised Ensemble Learning Approaches. International Workshop on Complex Machine Learning Problems with Ensemble Methods, pp.123-138, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-01339258
Classification and Regression Raywat MAKKHONGKAEW, Stéphane BONNEVAY, Alexandre AUSSEM and Khalid BENABDESLEM Trees. CHAPMAN & HALL/CRC, 1984. ,
Partitioning Nominal Attributes in Decision Trees, Data Mining and Knowledge Discovery, vol.3, issue.2, pp.197-217, 1999. ,
DOI : 10.1023/A:1009869804967
A more robust boosting algorithm, 2009. ,
A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting, Journal of Computer and System Sciences, vol.55, issue.1, pp.119-139, 1997. ,
DOI : 10.1006/jcss.1997.1504
Greedy function approximation: A gradient boosting machine, The Annals of Statistics, pp.1189-1232, 2001. ,
Extremely randomized trees, Machine Learning, pp.3-42, 2006. ,
DOI : 10.1007/s10994-006-6226-1
URL : https://hal.archives-ouvertes.fr/hal-00341932
Data Mining, 2001. ,
DOI : 10.1007/978-1-4899-7993-3_104-2
A Practical Guide to Support Vector Classification, 2010. ,
How large should ensembles of classifiers be?, Pattern Recognition, vol.46, issue.5, pp.1323-1336, 2013. ,
DOI : 10.1016/j.patcog.2012.10.021
Analyzing microarray gene expression data, 2004. ,
DOI : 10.1002/047172842X
Rotation Forest: A New Classifier Ensemble Method, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.28, issue.10, pp.1619-1630, 2006. ,
DOI : 10.1109/TPAMI.2006.211
Ensemble methods: Foundations and algorithms [book review], Computational Intelligence Magazine, pp.77-79, 2013. ,
DOI : 10.1109/mci.2012.2228600
RotBoost: A technique for combining Rotation Forest and AdaBoost, Pattern Recognition Letters, vol.29, issue.10, pp.1524-1536, 2008. ,
DOI : 10.1016/j.patrec.2008.03.006