Spectrum of Variable-Random Trees

Journal of Artificial Intelligence Research

Volumn 32, Issue , 2008, Pages 355-384

  Liu, Fei Tony ^a   Ting, Kai Ming ^a   Yu, Yang ^b   Zhou, Zhi Hua ^b  

^a MONASH UNIVERSITY   (Australia)

^b NANJING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; RANDOM PROCESSES;

CONTINUOUS SPECTRUM; DIVERSE ENSEMBLES; EMPIRICAL STUDIES; ENSEMBLE METHODS; OPERATING POINTS; RANDOM FORESTS; RANDOM SUBSPACES; TREE ENSEMBLES;

COALESCENCE;

EID: 52249099075     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2470     Document Type: Article

References (27)

1. Asuncion, A., & Newman, D. J. (2007). UCI machine learning repository.. http://www.ics.uci.edu/~mlearn/MLRepository.html.
2. Bauer, E., & Kohavi, R. (1999). An empirical comparison of voting classification algorithms: Bagging, boosting, and variants. Machine Learning, 36(1-2), 105-139.
3. Bousquet, O., & Elisseeff, A. (2002). Stability and generalization. Journal of Machine Learning Research, 2,499-526.
4. Breiman, L. (1996a). Bagging predictors. Machine Learning, 24(2), 123-140.
5. Breiman, L. (1996b). Stacked regressions. Machine Learning, 24(1), 49-64.
6. Breiman, L. (2000). Randomizing outputs to increase prediction accuracy. Machine Learning, 40(3), 229-242.
7. Breiman, L. (2001). Random forests. Machine Learning, 45(1), 5-32.
8. Buttrey, S. E., & Kobayashi, I. (2003). On strength and correlation in random forests. In Proceedings of the 2003 Joint Statistical Meetings, Section on Statistical Computing, San Francisco, CA. American Statistical Association.
9. Cutler, A., & Zhao, G. (2001). PERT - perfect random tree ensembles. In Computing Science and Statistics, Vol. 33, pp. 490-497, Costa Mesa, Orange Country, California.
10. Demšar, J. (2006). Statistical comparisons of classifiers over multiple data sets. Journal Machine Learning Research, 7, 1-30.
11. Dietterich, T. G. (2000). An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. Machine Learning, 40(2), 139-157.
12. Fan, W. (2004). On the optimality of probability estimation by random decision trees. In Proceedings of the Nineteenth National Conference on Artificial Intelligence, Sixteenth Conference on Innovative Applications of Artificial Intelligence (AAAI), pp. 336-341, California, USA. AAAI Press / The MIT Press.
13. Fan, W., Wang, H., Yu, P. S., & Ma, S. (2003). Is random model better? on its accuracy and efficiency. ICDM '03: Proceedings of the Third IEEE International Conferenceon Data Mining, 51-58.
14. Geurts, P., Ernst, D., & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3-42.
15. Hastie, T., Tibshirani, R., & Friedman, J. (2001). The elements of statistical learning : Data mining, Inference, and Prediction. Springer-Verlag.
16. Ho, T. K. (1998). The random subspace method for constructing decision forests. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(8), 832-844.
17. Kobayashi, I. (2002). Randomized Ensemble Methods for Classification Trees. Ph.D. thesis, Naval Postgraduate School, Monterey, CA.
18. Liu, F. T., & Ting, K. M. (2006). Variable randomness in decision tree ensembles. In Advances in Knowledge Discovery and Data Mining, 10th Pacific-Asia Conference (PAKDD 2006), pp. 81-90, Singapore.
19. Liu, F. T., Ting, K. M., & Fan, W. (2005). Maximizing tree diversity by building complete-random decision trees. In Advances in Knowledge Discovery and Data Mining, 9th Pacific-Asia Conference (PAKDD 2005), pp. 605-610, Hanoi, Vietnam.
20. Melville, P., & Mooney, R. (2003). Constructing diverse classifier ensembles using artificial training examples. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, pp. 505-510, Mexico.
21. Perrone, M. P., & Cooper, L. N. (1993). When networks disagree: ensemble methods for hybrid neural networks. Artificial Neural Networks for Speech and Vision, 126-142.
22. Quinlan, R. J. (1993). C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, Calif.
23. Robnik-Šikonja, M. (2004). Improving random forests.. In Boulicaut, J.-F, Esposito, E, Giannotti, F., & Pedreschi, D. (Eds.), Proceedings of The 15th European Conference on Machine Learning (ECML 2004), Vol. 3201 of Lecture Notes in Computer Science, pp. 359-370, Pisa, Italy. Springer.
24. Ting, K. M., & Witten, I. H. (1999). Issues in stacked generalization. Journal of Artifical Intelligence Research (JAIR), 10, 271-289.
25. Webb, G. I. (2000). Multiboosting: A technique for combining boosting and wagging. Machince Learning, 40(2), 159-196.
26. Webb, G. I., & Zheng, Z. (2004). Multistrategy ensemble learning: Reducing error by combining ensemble learning techniques. IEEE Transactions on Knowledge and Data Engineering, 16(8), 980-991.
27. Zadrozny, B., & Elkan, C. (2001). Obtaining calibrated probability estimates from decision trees and naive bayesian classifiers. ICML '01: Proceedings of the Eighteenth International Conference on Machine Learning, 609-616.