Interruptible anytime algorithms for iterative improvement of decision trees

Proceedings of the 1st International Workshop on Utility-Based Data Mining, UBDM '05

Volumn , Issue , 2005, Pages 78-85

  Esmeir, Saher ^a   Markovitch, Shaul ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

anytime algorithms; anytime learning; cost quality tradeoff; decision trees; hard concepts

Indexed keywords

ANYTIME ALGORITHM; ANYTIME LEARNING; APRIORI; DECISION TREE INDUCTION; EMPIRICAL EVALUATIONS; ITERATIVE IMPROVEMENTS; MARGINAL UTILITY; NP COMPLETE PROBLEMS; PERFORMANCE PROFILE; SUBTREES; TIME ALLOCATION;

DATA MINING; DECISION TREES; ITERATIVE METHODS; RESOURCE ALLOCATION;

LEARNING ALGORITHMS;

EID: 77953547618     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1089827.1089837     Document Type: Conference Paper

References (32)

1. C. L. Blake and C. J. Merz. UCI repository of machine learning databases, 1998.
2. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Occam's Razor. Information Processing Letters, 24(6):377-380, 1987.
3. M. Boddy and T. L. Dean. Deliberation scheduling for problem solving in time constrained environments. Artificial Intelligence, 67(2):245-285, 1994.
4. R. R. Bouckaert. Choosing between two learning algorithms based on calibrated tests. In ICML'03, pages 51-58, Washington, DC, USA, 2003.
5. L. Breiman. Bagging predictors. Machine Learning, 24(2):123-140, 1996.
6. L. Breiman, J. Friedman, R. Olshen, and C. Stone. Classification and Regression Trees. Wadsworth and Brooks, Monterey, CA, 1984.
7. C. J. C. Burges. A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery, 2(2):121-167, 1998. (Pubitemid 128695475)
8. M. W. Craven and J. W. Shavlik. Extracting Comprehensible Models from Trained Neural Networks. PhD thesis, Computer Science department, University of Wisconsin, Madison, 1996.
9. S. Esmeir and S. Markovitch. Lookahead-based algorithms for anytime induction of decision trees. In ICML'04, pages 257-264, 2004.
10. W. Fan, H. Wang, P. S. Yu, and S. Ma. Is random model better? on its accuracy and efficiency. In ICDM'03, pages 51-58, 2003.
11. Y. Freund and L. Mason. The alternating decision tree learning algorithm. In Proceedings of the Sixteenth International Conference on Machine Learning, pages 124-133, Bled, Slovenia, 1999.
12. E. Gabrilovich and S. Markovitch. Text categorization with many redundant features: Using aggressive feature selection to make svms competitive with c4.5. In ICML'04, pages 321-328, 2004.
13. T. Hastie, R. Tibshirani, and J. Friedman. The elements of statistical learning: data mining, inference, and prediction. New York: Springer-Verlag, 2001.
14. E. Hovitz. Computation and Action under Bounded Resources. PhD thesis, Computer Science Department, Stanford University, 1990.
15. J. Huang, J. Lu, and C. Ling. Comparing naive bayes, decision trees, and svm using accuracy and auc. In ICDM'03, Melbourne, FL, 2003.
16. L. Hyafil and R. L. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15-17, 1976.
17. M. Last, A. Kandel, O. Maimon, and E. Eberbach. Anytime algorithm for feature selection. In RSCTC'01, pages 532-539. Springer-Verlag, 2001.
18. D. J. Lizotte, O. Madani, and R. Greiner. Budgeted learning of naive bayes classifiers. In UAI'03, Acapulco, Mexico, 2003.
19. O. J. Murphy and R. L. McCraw. Designing storage efficient decision trees. IEEE Transactions on Computers, 40(3):315-320, 1991.
20. D. W. Opitz. An Anytime Approach to Connectionist Theory Refinement: Refining the Topologies of Knowledge-Based Neural Networks. PhD thesis, Department of Computer Sciences, University of Wisconsin-Madison, 1995.
21. A. Papagelis and D. Kalles. Breeding decision trees using evolutionary techniques. In ICML'01, pages 393-400, San Francisco, CA, USA, 2001.
22. J. R. Quinlan. Induction of decision trees. Machine Learning, 1:81-106, 1986.
23. J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, CA, 1993.
24. S. J. Russell and E. Wefald. Principles of metareasoning. In KR'89, pages 400-411, San Mateo, California, 1989.
25. S. J. Russell and S. Zilberstein. Composing real-time systems. In IJCAI'91, pages 212-217, Sydney, Australia, 1991.
26. S. J. Russell and S. Zilberstein. Optimal composition of real-time systems. Artificial Intelligence, 82(1-2):181-213, 1996.
27. R. Schapire. A brief introduction to boosting. In IJCAI'99, pages 1401-1406, Stockholm, Sweden, 1999.
28. Y. Shan, E. Milios, A. Roger, C. Blouin, and E. Susko. Automatic recognition of regions of intrinsically poor multiple alignment using machine learning. In CSB'03, 2003.
29. J. W. Shavlik, R. J. Mooney, and G. G. Towell. Symbolic and neural learning algorithms: An experimental comparison. Machine Learning, 6(2):111-143, 1991.
30. P. E. Utgoff. Incremental induction of decision trees. Machine Learning, 4(2):161-186, 1989.
31. P. E. Utgoff, N. C. Berkman, and J. A. Clouse. Decision tree induction based on efficient tree restructuring. Machine Learning, 29(1):5-44, 1997. (Pubitemid 127507172)
32. X. Zhu, S. Sun, S. E. Cheng, and M. Bern. Classification of protein crystallization imagery. In EMBS'04, San Francisco, CA, 2004.