Boosting Using Branching Programs
暂无分享,去创建一个
[1] David A. Mix Barrington,et al. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1986, STOC '86.
[2] Yoav Freund,et al. Boosting a weak learning algorithm by majority , 1995, COLT '90.
[3] Yoav Freund,et al. Boosting a weak learning algorithm by majority , 1990, COLT '90.
[4] Vijay Raghavan,et al. Learning μ-branching programs with queries , 1993, COLT '93.
[5] Ronitt Rubinfeld,et al. On learning bounded-width branching programs , 1995, COLT '95.
[6] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.
[7] Yishay Mansour,et al. On the boosting ability of top-down decision tree learning algorithms , 1996, STOC '96.
[8] Christino Tamon,et al. On Learning Branching Programs and Small Depth Circuits , 1996, Electron. Colloquium Comput. Complex..
[9] Thomas G. Dietterich,et al. Applying the Waek Learning Framework to Understand and Improve C4.5 , 1996, ICML.
[10] Nader H. Bshouty,et al. On Learning width Two Branching Programs , 1998, Inf. Process. Lett..
[11] Yishay Mansour,et al. Boosting with Multi-Way Branching in Decision Trees , 1999, NIPS.
[12] Yishay Mansour,et al. On the Boosting Ability of Top-Down Decision Tree Learning Algorithms , 1999, J. Comput. Syst. Sci..