A fast way to produce near-optimal fixed-depth decision trees

10th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2008

Volumn , Issue , 2008, Pages

  Farhangfar, Alireza ^a   Greiner, Russell ^a   Zinkevich, Martin ^a,b  

^a UNIVERSITY OF ALBERTA   (Canada)

^b YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASS LABELS; CLASSIFICATION ACCURACY; CLASSIFICATION TASKS; COMPUTATIONAL COSTS; DATA SETS; POSTERIOR PROBABILITY; PRE-PROCESSING STEP; PRECOMPUTE; UCI REPOSITORY;

ARTIFICIAL INTELLIGENCE; OPTIMIZATION;

DECISION TREES;

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

References (19)

1. Auer, P.; Holte, R. C.; and Maass, W. 1995. Theory and applications of agnostic PAC-learning with small decision trees. In ICML.
2. Bennett, K., and Blue, J. A. 1996. Optimal decision trees. Rensselaer Polytechnic Institute Math Report (214).
3. Breiman, L.; Friedman, J.; Olshen, J.; and Stone, C. 1984. Classification and Regression Trees. Monterey, CA: Wadsworth and Brooks.
4. Chan, H., and Darwiche, A. 2003. Reasoning about bayesian network classifiers. In UAI, 107.116.
5. Dietterich, T. G. 2000. Ensemble methods in machine learning. In First InternationalWorkshop on Multiple Classifier Systems.
6. Dobkin, D.; Gunopoulos, D.; and Kasif, S. 1996. Computing optimal shallow decision trees. In International Symposium on Artificial Intelligence and Mathematics.
7. Domingos, P., and Pazzani, M. 1997. On the optimality of the simple bayesian classifier under zero-one loss. Machine Learning 29:103.130. (Pubitemid 127510035)
8. Duda, R. O., and Hart, P. E. 1973. Pattern Classification and Scence Analysis. Wiley.
9. Greiner, R.; Grove, A.; and Roth, D. 2002. Learning cost-sensitive active classifiers. Artificial Intelligence 139:137. 174.
10. Greiner. 2007. http://www.cs.ualberta.ca/.greiner/RESEARCH/DT-NB.
11. Holte, R. C. 1993. Very simple classification rules perform well on most commonly used datasets. Machine Learning 11:63.91.
12. Kapoor, A., and Greiner, R. 2005. Learning and classifying under hard budgets. In Proceedings of the Sixteenth European Conference on Machine Learning (ECML-05), 170-181. Springer.
13. Lewis, D. D. 1998. Naïve Bayes at forty: The independence assumption in information retrieval. In ECML.
14. Newman, D. J.; Hettich, S.; Blake, C. L.; and Merz, C. J. 1998. UCI Repository of Machine Learning Databases. University of California, Irvine, Dept. of Information and Computer Sciences: http://www.ics.uci.edu/.mlearn/ MLRepository.html.
15. Nijssen, S., and Fromont, E. 2007. Mining optimal decision trees from itemset lattices. In The 13th International Conference on Knowledge Discovery and Data Mining (KDD2007).
16. Quinlan, J. R. 1986. Induction of decision trees. Machine Learning 1:81.106.
17. Quinlan, J. R. 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann.
18. Sutton, R. S., and Barto, A. G. 1998. Reinforcement Learning. MIT Press.
19. Turney, P. D. 2000. Types of cost in inductive concept learning. In Workshop on Cost-Sensitive Learning (ICML-2000).