On the optimality of probability estimation by random decision trees

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 336-341

  Fan, Wei ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLIC GRAPHS; DECISION TREES; ERROR TOLERANCE; PROBABILITY ESTIMATION;

APPROXIMATION THEORY; ERROR ANALYSIS; ESTIMATION; FUNCTIONS; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES;

TREES (MATHEMATICS);

EID: 9444240308     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. Bradford, J. P.; Kunz, C.; Kohavi, R.; Brunk, C.; and Brodley, C. E. 1998. Pruning decision trees with misclassification costs. In European Conference on Machine Learning, 131-136.
2. Breiman, L. 2001. Random forests. Machine Learning 45(1):5-32.
3. Fan, W.; Wang, H.; Yu, P. S.; and Ma, S. Nov 2003. Is random model better? on its accuracy and efficiency. In Proceedings of Third IEEE International Conference on Data Mining (ICDM-2003).
4. Kearns, M., and Mansour, Y. 1996. On the boosting ability of top-down decision tree learning algorithms. In Proceedings of the Annual ACM Symposium on the Theory of Computing, 459-468.
5. Mehta, M.; Agrawal, R.; and Rissanen, J. 1996. SLIQ: A fast scalable classifier for data mining. In Extending Database Technology, 18-32.
6. Mehta, M.; Rissanen, J.; and Agrawal, R. 1995. MDL-based decision tree pruning. In Proceedings of the First International Conference on Knowledge Discovery and Data Mining (KDD'95), 216-221.
7. Quinlan, R. 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann.