Generalization in Decision Trees and DNF: Does Size Matter?
暂无分享,去创建一个
[1] Aiko M. Hormann,et al. Programs for Machine Learning. Part I , 1962, Inf. Control..
[2] Leo Breiman,et al. Classification and Regression Trees , 1984 .
[3] David Haussler,et al. Learning decision trees from random examples , 1988, COLT '88.
[4] Usama M. Fayyad,et al. What Should Be Minimized in a Decision Tree? , 1990, AAAI.
[5] J. Ross Quinlan,et al. C4.5: Programs for Machine Learning , 1992 .
[6] 金田 重郎,et al. C4.5: Programs for Machine Learning (書評) , 1995 .
[7] Geoffrey I. Webb. Further Experimental Evidence against the Utility of Occam's Razor , 1996, J. Artif. Intell. Res..
[8] John Shawe-Taylor,et al. A framework for structural risk minimisation , 1996, COLT '96.
[9] Peter L. Bartlett,et al. For Valid Generalization the Size of the Weights is More Important than the Size of the Network , 1996, NIPS.
[10] Yoav Freund,et al. Boosting the margin: A new explanation for the effectiveness of voting methods , 1997, ICML.
[11] Russell Greiner,et al. Exploring the Decision Forest: An Empirical Investigation of Occam's Razor in Decision Tree Induction , 1997 .