Maximizing Tree Diversity by Building Complete-Random Decision Trees
暂无分享,去创建一个
[1] Tin Kam Ho,et al. The Random Subspace Method for Constructing Decision Forests , 1998, IEEE Trans. Pattern Anal. Mach. Intell..
[2] Catherine Blake,et al. UCI Repository of machine learning databases , 1998 .
[3] Leo Breiman,et al. Random Forests , 2001, Machine Learning.
[4] Thomas G. Dietterich. An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization , 2000, Machine Learning.
[5] Yali Amit,et al. Shape Quantization and Recognition with Randomized Trees , 1997, Neural Computation.
[6] Pedro M. Domingos. Bayesian Averaging of Classifiers and the Overfitting Problem , 2000, ICML.
[7] Leo Breiman,et al. Randomizing Outputs to Increase Prediction Accuracy , 2000, Machine Learning.
[8] Philip S. Yu,et al. Is random model better? On its accuracy and efficiency , 2003, Third IEEE International Conference on Data Mining.
[9] G DietterichThomas. An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees , 2000 .
[10] J. Ross Quinlan,et al. C4.5: Programs for Machine Learning , 1992 .
[11] Leo Breiman,et al. Bagging Predictors , 1996, Machine Learning.