Experiments on Ensembles with Missing and Noisy Data

作者: Prem Melville , Nishit Shah , Lilyana Mihalkova , Raymond J. Mooney

DOI: 10.1007/978-3-540-25966-4_29

关键词:

摘要: One of the potential advantages of multiple classifier systems is an increased robustness to noise and other imperfections in data. Previous experiments on classification noise have shown that bagging is fairly robust but that boosting is quite sensitive. Decorate is a recently introduced ensemble method that constructs diverse committees using artificial data. It has been shown to generally outperform both boosting and bagging when training data is limited. This paper compares the sensitivity of bagging, boosting, and Decorate to three …

参考文章(19)
Steven L. Salzberg, Alberto Segre, Programs for Machine Learning ,(1994)
Smooth boosting and learning with malicious noise Journal of Machine Learning Research. ,vol. 4, pp. 633- 648 ,(2003) , 10.1162/153244304773936072
Mark A. Hall, Ian H. Witten, Eibe Frank, Data Mining: Practical Machine Learning Tools and Techniques ,(1999)
Ross A. McDonald, David J. Hand, Idris A. Eckley, An Empirical Comparison of Three Boosting Algorithms on Real Data Sets with Artificial Class Noise Multiple Classifier Systems. pp. 35- 44 ,(2003) , 10.1007/3-540-44938-8_4
J. R. Quinlan, Bagging, boosting, and C4.S national conference on artificial intelligence. pp. 725- 730 ,(1996)
Adam Kalai, Rocco A Servedio, None, Boosting in the presence of noise Journal of Computer and System Sciences. ,vol. 71, pp. 266- 290 ,(2005) , 10.1016/J.JCSS.2004.10.015
Geoffrey I. Webb, MultiBoosting: A Technique for Combining Boosting and Wagging Machine Learning. ,vol. 40, pp. 159- 196 ,(2000) , 10.1023/A:1007659514849
Robert E. Schapire, Yoav Freund, Experiments with a new boosting algorithm international conference on machine learning. pp. 148- 156 ,(1996)
Ian H. Witten, Eibe Frank, Data mining ACM SIGMOD Record. ,vol. 31, pp. 76- 77 ,(2002) , 10.1145/507338.507355