An optimal constrained pruning strategy for decision trees

INFORMS Journal on Computing

Volumn 21, Issue 1, 2009, Pages 49-61

  Sherali, Hanif D ^a   Hobeika, Antoine G ^a   Jeenanunta, Chawalit ^b  

^a State University   (United States)

^b THAMMASAT UNIVERSITY   (Thailand)

Author keywords

Analysis of algorithms; Decision analysis; Integer; Programming; Transportation

Indexed keywords

EID: 67649980316     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1080.0278     Document Type: Article

References (31)

1. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ.
2. Bazaraa, M. S., J. J. Jarvis, H. D. Sherali. 2005. Linear Programming and Network Flows, 3rd ed. John Wiley & Sons, New York.
3. Bennett, K. P. 1992. Decision tree construction via linear programming. Proc. 4th Midwest Artificial Intelligence Cognitive Sci. Soc. Conf., Utica, IL, Southern Illinois University Carbondale, Carbondale, 97-101.
4. Bennett, K. P. 1994. Global tree optimization: A non-greedy decision tree algorithm. Comput. Sci. Statist. 26 156-160.
5. Berkelaar, M. 1997. lpsolve 2.0. http://www.cs.wustl.edu/ ∼javagrp/help/LinearProgramming.html.
6. Bertsekas, D. P. 2001. Dynamic Programming and Optimal Control. Athena Scientific, Belmont, MA.
7. Bredensteiner, E. J., K. P. Bennett. 1998. Feature minimization within decision trees. Comput. Optim. Appl. 10(2) 111-126.
8. Breiman, L., J. H. Friedman, L. A. Olshen, C. J. Stone. 1984. Classification and Regression Trees. Wadsworth & Brooks, Pacific Grove, CA.
9. Breslow, L. A., D. W. Aha. 1997. Simplifying decision trees: A survey. Knowledge Engrg. Rev. 12(1) 1-40.
10. Chou, P. A., T. Lookabaugh, R. M. Gray. 1989. Optimal pruning with applications to tree-structured source coding and modeling. IEEE Trans. Inform. Theory 35(2) 229-315.
11. CPLEX. 2005. Using the CPLEX Linear Optimizer, version 9.0. CPLEX Optimization, Inc., Incline Village, NV.
12. Folino, G., C. Pizzuti, G. Spezzano. 1999. A cellular genetic programming approach to classification. Proc. Genetic and Evolutionary Comput. Conf., GECCO99, Orlando, FL, Morgan Kaufmann, San Francisco, 1015-1020.
13. Folino, G., C. Pizzuti, G. Spezzano. 2001. Parallel genetic programming for decision tree induction. Proc. 13th Internat. Conf. Tools with Artificial Intelligence, Dallas, IEEE Computer Society, Washington, D.C., 129-135.
14. Folino, G., C. Pizzuti, G. Spezzano. 2002. Improving induction decision trees with parallel genetic programming. Proc. 10th Euromicro Workshop on Parallel, Distributed Network-based Processing, IEEE Computer Society, Washington, D.C., 181-187.
15. Fu, Z., B. Golden, S. Lele, S. Raghavan, E. Wasil. 2003a. A genetic algorithm-based approach for building accurate decision trees. INFORMS J. Comput. 15(1) 3-22.
16. Fu, Z., B. Golden, S. Lele, S. Raghavan, E. Wasil. 2003b. Genetically engineered decision trees: Population diversity produces smarter trees. Oper. Res. 51(6) 894-907.
17. Fu, Z., B. Golden, S. Lele, S. Raghavan, E. Wasil. 2006. Diversification for better classification trees. Comput. Oper. Res. 33(11) 3185-3202.
18. Li, X., J. Sweigart, J. Teng, J. Donohue, L. Thombs. 2001. A dynamic programming based pruning method for decision trees. INFORMS J. Comput. 13(4) 332-344.
19. Lin, J., J. A. Storer, M. Cohn. 1992. Optimal pruning for treestructured vector quantization. Inform. Processing Management28 723-733. Los Alamos National Laboratory. 2002a. Transportation Analysis Simulation System (TRANSIMS) version: TRANSIMS-LANL- 3.0. Los Alamos, NM. Los Alamos National Laboratory. 2002b. Transportation Analysis Simulation System (TRANSIMS): Portland Study Reports. Los Alamos, NM.
20. Mehta, M., J. Rissanen, R. Agrawal. 1995. MDL-based decision tree pruning. Proc. First Internat. Conf. Knowledge Discovery and Data Mining (KDD), Montreal, AAAI Press, Menlo Park, CA, 216-221.
21. Murthy, S. K. 1997. On growing better decision trees from data. Ph.D. dissertation, University of Maryland, College Park.
22. Murthy, S. K. 1998. Automatic construction of decision trees from data: A multi-disciplinary survey. Data Mining Knowledge Discovery2(4) 345-389.
23. Nemhauser, G. L., L. A. Wolsey. 1999. Integer and Combinatorial Optimization, 2nd ed. John Wiley & Sons, New York.
24. Quinlan, J. R. 1988. Simplifying decision trees. B. Gaines, J. Boose, eds. Knowledge Acquisition for Knowledge-Based Systems. Academic Press, London, 239-252.
25. Quinlan, J. R., R. L. Rivest. 1989. Inferring decision trees using the minimum description length principle. Inform. Comput. 80227-248.
26. Rastogi, R., K. Shim. 1998. PUBLIC: A decision tree classifier that integrates building and pruning. Proc. 24th VLDB (Very Large Data Bases(Conf., New York, Morgan Kaufman Publishers, San Francisco, 404-415.
27. Safavin, S. R., D. Landgrebe. 1991. A survey of decision tree classifier methodology. IEEE Trans. Systems, Man, Cybernetics 21(3) 660-674.
28. Sherali, H. D. 1991. On the equivalence between some shortest path problems. Oper. Res. Lett. 10(2) 61-65.
29. Sherali, H. D., A. L. Soyster. 1983. Preemptive and nonpreemptive multi-objective programs: Relationships and counter examples. J. Optim. Theory Appl. 39(2) 173-186.
30. Ye, N. 2003. Handbook of Data Mining. Lawrence Erlbaum Associates, Mahwah, NJ.
31. Zhang, Y., H. Huei-chuen. 2005. Decision tree pruning via integer programming. Working paper, Department of Management Sciences, University of Iowa, Iowa City.