Training Methods for Adaptive Boosting of Neural Networks
暂无分享,去创建一个
[1] Yann LeCun,et al. Efficient Pattern Recognition Using a New Transformation Distance , 1992, NIPS.
[2] Maurice Milgram,et al. Transformation Invariant Autoassociation with Application to Handwritten Character Recognition , 1994, NIPS.
[3] Corinna Cortes,et al. Boosting Decision Trees , 1995, NIPS.
[4] Holger Schwenk,et al. Learning Discriminant Tangent Models for Handwritten Character Recognition , 1995 .
[5] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.
[6] Yoav Freund,et al. Experiments with a New Boosting Algorithm , 1996, ICML.
[7] J. Ross Quinlan,et al. Bagging, Boosting, and C4.5 , 1996, AAAI/IAAI, Vol. 1.
[8] Leo Breiman,et al. Bias, Variance , And Arcing Classifiers , 1996 .
[9] Maurice Milgram,et al. Constraint tangent distance for on-line character recognition , 1996, Proceedings of 13th International Conference on Pattern Recognition.
[10] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1997, EuroCOLT.
[11] Yoav Freund,et al. Boosting the margin: A new explanation for the effectiveness of voting methods , 1997, ICML.