Part 6: Geometrical Structure of Boosting Algorithm
暂无分享,去创建一个
[1] John D. Lafferty,et al. Boosting and Maximum Likelihood for Exponential Models , 2001, NIPS.
[2] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.
[3] Yoav Freund,et al. Boosting the margin: A new explanation for the effectiveness of voting methods , 1997, ICML.
[4] Takafumi Kanamori,et al. Information Geometry of U-Boost and Bregman Divergence , 2004, Neural Computation.
[5] Michael I. Jordan,et al. Convexity, Classification, and Risk Bounds , 2006 .
[6] Mihoko Minami,et al. Robust Blind Source Separation by Beta Divergence , 2002, Neural Computation.
[7] Takafumi Kanamori,et al. The Most Robust Loss Function for Boosting , 2004, ICONIP.
[8] Y. Freund,et al. Discussion of the Paper \additive Logistic Regression: a Statistical View of Boosting" By , 2000 .
[9] Robert E. Schapire,et al. The strength of weak learnability , 1990, Mach. Learn..
[10] Shinto Eguchi,et al. Robustifying AdaBoost by Adding the Naive Error Rate , 2004, Neural Computation.