Geometric Bounds for Generalization in Boosting
暂无分享,去创建一个
[1] L. Devroye,et al. Nonparametric Density Estimation: The L 1 View. , 1985 .
[2] J. Friedman. Special Invited Paper-Additive logistic regression: A statistical view of boosting , 2000 .
[3] Yoav Freund,et al. Game theory, on-line prediction and boosting , 1996, COLT '96.
[4] Yoav Freund,et al. Experiments with a New Boosting Algorithm , 1996, ICML.
[5] Alexander A. Razborov,et al. Majority gates vs. general weighted threshold gates , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.
[6] Ralph Alexander,et al. Geometric methods in the study of irregularities of distribution , 1990, Comb..
[7] R. Alexander. Principles of a new method in the study of irregularities of distribution , 1991 .
[8] Dmitry Panchenko,et al. Some New Bounds on the Generalization Error of Combined Classifiers , 2000, NIPS.
[9] Yoav Freund,et al. Boosting a weak learning algorithm by majority , 1995, COLT '90.
[10] John Shawe-Taylor,et al. Structural Risk Minimization Over Data-Dependent Hierarchies , 1998, IEEE Trans. Inf. Theory.
[11] Yoav Freund,et al. Boosting the margin: A new explanation for the effectiveness of voting methods , 1997, ICML.
[12] Yoram Singer,et al. Improved Boosting Algorithms Using Confidence-rated Predictions , 1998, COLT' 98.