An Optimal Constrained Pruning Strategy for Decision Trees

References

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