期刊文献+

分类器动态组合及基于分类器组合的集成学习算法 被引量:3

Dynamic Combination Method of Classifiers and Ensemble Learning Algorithms Based on Classifiers Combination
在线阅读 下载PDF
导出
摘要 针对目前基于分类器静态组合的集成学习算法难于推广的问题,根据组合分类器分类错误最小化原则,研究了组合系数随分类器输出变化而变化的分类器动态组合理论,包括组合系数的选取、组合分类器分类错误率的估计等。证明了在分类器相互独立时,一些动态组合分类器等价于Bayes统计推断。提出了基于分类器组合的通用集成学习算法,并把AdaBoost、Real AdaBoost、Gentle AdaBoost算法推广到了多分类问题。证明了按照集成学习算法得到的分类器,其动态组合的有效性可不依赖于分类器的独立性,这支撑了基于分类器相互独立假设来研究分类器组合的有用性。最后,通过UCI数据实验验证了动态组合的有效性。 For the generalization problem of ensemble learning algorithms based on classifiers static combination,by minimizing the error of combination classifier,a dynamic combination method of classifiers was studied,in which the combination coefficients varied according to the output.Specially,the selection of combination coefficient and the estimation of classification error rate of combination classifier were researched.It was proved that some dynamic combination classifiers were equal to Bayes statistical deduction when the classifiers were independent of each other.The method for constructing general ensemble learning algorithm based on classifiers combination was put forward,and AdaBoost,Real AdaBoost,and Gentle AdaBoost algorithms were extended to solve the multi-class classification problem.It was proved that the efficiency of the dynamic combination in the classifier obtained by ensemble learning algorithm did not need the condition that the combined classifiers were independent.Therefore,the feasibility of classifier combination under the assumption that the combined classifiers were independent was obtained.At last,the dynamic combination method was verified efficient by the experiments on UCI dataset.
出处 《四川大学学报(工程科学版)》 EI CAS CSCD 北大核心 2011年第2期58-65,共8页 Journal of Sichuan University (Engineering Science Edition)
基金 国家"863"计划资助项目(2008AAO1Z402) 四川省重点科技计划资助项目(2008SZ0100 2009SZ0214)
关键词 分类器动态组合 集成学习 多分类问题 ADABOOST dynamic combination of classifiers enable learning multi-class classification problem AdaBoost
  • 相关文献

参考文献14

  • 1Schapire R E. Thestrength of weak learnability[ J]. Machine Learning, 1990,5 ( 2 ) : 197 - 227.
  • 2Freund Y, Schapire R E. A decision-theoretic generalization of on-line learning and an application to boosting[ J]. Journal of Computer and System Sciences, 1997,55 ( 1 ) : 119 - 139.
  • 3Breiman L. Random forests [ J ]. Machine Learning, 2001,45 (1) :5 -32.
  • 4付忠良.关于AdaBoost有效性的分析[J].计算机研究与发展,2008,45(10):1747-1755. 被引量:47
  • 5付忠良.分类器线性组合的有效性和最佳组合问题的研究[J].计算机研究与发展,2009,46(7):1206-1216. 被引量:29
  • 6Zhu J, Rosset S, Zou H, et al. Multi-class AdaBoost [ J ]. Statistics and Its Interface ,2009 ( 2 ) :349 - 360.
  • 7Gao C, Sang N, Tang Q L. On selection and combination of weak learners in AdaBoost [ J ]. Patter Recognition Letter, 2010(31 ) :991 - 1001.
  • 8Viola P,Jones M. Robust real-time face detection [ J ]. International Journal of Computer Vision, 2004,57 ( 2 ) : 137 - 154.
  • 9梁路宏,艾海舟,徐光祐,张钹.人脸检测研究综述[J].计算机学报,2002,25(5):449-458. 被引量:355
  • 10Schapire R E, Singer Y. Improved boosting algorithms using confidence-rated predictions [ J]. Machine Learning, 1999, 37(3) :297 -336.

二级参考文献98

  • 1燕继坤,郑辉,王艳,曾立君.基于可信度的投票法[J].计算机学报,2005,28(8):1308-1313. 被引量:8
  • 2武勃,黄畅,艾海舟,劳世竑.基于连续Adaboost算法的多视角人脸检测[J].计算机研究与发展,2005,42(9):1612-1621. 被引量:66
  • 3Valiant L G.A theory of the learnable[J].Communications of the ACM,1984,27(11):1134-1142.
  • 4Schapire R E.The strength of weak learnability[J].Machine Learning,1990,5(2):197-227.
  • 5Freund Y,Schapire R E.A decision-theoretic generalization of on-line learning and an application to boosting[J].Journal of Computer and System Sciences,1997,55(1):119-139.
  • 6Breirnan L.Bagging predicators[J].Machine Learning,1996,24(2):123-140.
  • 7Xu L,Krzyzak A,Suen C Y.Methods of combining multiple classifiers and their application to handwriting recognition[J].IEEE Trans on System,Man,and Cybernetics,1992,22(3):418-435.
  • 8Perrone M P.Improving regression estimationn:Averaging methods for variance reduction with extensions to general convex measure optimization[D].Rhode Island,USA:Brown University,Department of Physics,1993.
  • 9Fumera G,Roil F.A theoretical and experimental analysis of linear combiners for multiple classifier systems[J].IEEE Trans on Pattern Analysis and Machine Intelligence,2005,27(6):942-956.
  • 10Kittler J,Hater M,Duin R,et al.On combining classifiers[J].IEEE Trans on Pattern Analysis and Machine Intelligence.1998,20(3):226-234.

共引文献415

同被引文献25

  • 1凌晓峰,SHENG Victor S..代价敏感分类器的比较研究(英文)[J].计算机学报,2007,30(8):1203-1212. 被引量:35
  • 2Freund Y, Schapire R E. A decision-theoretic generalization of on-line learning and an application to boosting [J]. Journal of Computer and System Sciences, 1997, 55(1) : 119-139.
  • 3Valiant L G. A theory of learnable[J] Communications of the ACM, 1984, 27(11)z 1134-1142.
  • 4Kearns M, Valiant L G. Learning boolean formulate or factoring, TR-1488 [R]. Cambridge, MA: Havard University Aiken Computation Laboratory, 1988.
  • 5Kearns M, Valiant L G. Grytographie limitation on learning Boolean formulae and finite automata [C] //Proe of the 21st Annual ACM Syrup on Theory of Computing. New York: ACM, 1989: 433-444.
  • 6Schapire R E, Singer Y. Improved boosting algorithms using confidence-rated predictions [J]. Machine Learning, 1999, 37(3) : 297-336.
  • 7Friedman J, Hastie T, Tibshirani R. Additive logistic regression: A statistical view of boosting[J]. Annals of Statistics, 2000, 28(2): 337-374.
  • 8Viola P, Jones M. Robust real-time face detection[J]. Int Journal of Computer Vision, 2004, 57(2) : 137-154.
  • 9Zhu J, Rosset S, Zou H, et al. Multi-class AdaBoost [J]. Statistics and Its Interface, 2009(2) : 349-360.
  • 10Boutell M R, Luo J, Shen X P, et aI. Learning multi-label scene classification [J]. Pattern Recognition, 2004, 37 (9) : 1757-1771.

引证文献3

二级引证文献53

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部