FBP: A Frontier-Based Tree-Pruning Algorithm

References

• Blake C. L., Merz C. J. UCI Repository of machine learning databases. (1998) . Irvine, CA. http://www.ics.uci.edu/∼mlearn/MLRepository.htmlGoogle Scholar
• Breiman L., Friedman J., Olshen R., Stone C.Classification and Regression Trees (1984) (Wadsworth International Group, Belmont, CA) Google Scholar
• Buckheit J., Donoho D. L. WaveLab and reproducible research. (1995) . http://www-stat.stanford.edu/∼donoho/Reports/1995/wavelab.pdfGoogle Scholar
• Buja A., Lee Y.-S. Data mining criteria for tree-based regression and classification. Proc. Knowledge Discovery and Data Mining-2001 (2001) (ACM Press, New York) 27–36Crossref, Google Scholar
• Coifman R. R., Wickerhauser M. V. Entropy-based algorithms for best basis selection. IEEE Trans. Inform. Theory (1992) 38:713–718Crossref, Google Scholar
• Claerbout J., Schwab M. (2004) . http://sep.stanford.edu/research/redoc/Google Scholar
• Donoho D. L. CART and best-ortho-basis: A connection. Ann. Statist. (1997) 25:1870–1911Crossref, Google Scholar
• Donoho D. L. Wedgelets: Nearly minimax estimation of edges. Ann. Statist. (1999) 27:859–897Crossref, Google Scholar
• Donoho D., Duncun M. R., Huo X., Levi O. WaveLab. (2004) . http://www-stat.stanford.edu/∼wavelabGoogle Scholar
• Hamilton H. J. C4.5. (2004) . http://www2.cs.uregina.ca/∼hamilton/courses/831/notes/ml/dtrees/c4.5/tutorial.htmlGoogle Scholar
• Li X.-B., Sweigart J., Teng J., Donohue J., Thombs L. A dynamic programming based pruning method for decision trees. INFORMS J. Comput. (2001) 13:332–344Link, Google Scholar
• Luenberger D. G.Investment Theory (1998) (Oxford University Press, New York) Google Scholar
• Markowitz H. Portfolio selection. J. Finance (1952) 7:77–91Google Scholar
• Mitchell T. M.Machine Learning (1997) (McGraw-Hill, New York) Google Scholar
• Salford Systems CART and MARS. (2004) . http://www.salford-systems.com/Google Scholar