Tree-based methods and decision trees

Modern Analysis of Customer Surveys: with Applications using R

Volumn , Issue , 2011, Pages 283-307

  Galimberti, Giuliano ^a   Soffritti, Gabriele ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

ABC ACSS data set; CART; Chi square automatic interaction detection (CHAID); Customer satisfaction; Decision trees; PARTY; Tree based methods

Indexed keywords

EID: 84863308339     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9781119961154.ch15     Document Type: Chapter

References (59)

1. Agresti, A. (2002) Categorical Data Analysis, 2nd edn. New York: John Wiley & Sons, Inc.
2. Archer, K.J. (2010) rpartOrdinal: An R package for deriving a classification tree for predicting an ordinal response. Journal of Statistical Software, 34, 1-17.
3. Belson, W.A. (1959) Matching and prediction on the principle of biological classification. Applied Statistics, 8, 65-75.
4. Breiman, L. (1996a) Bagging predictors. Machine Learning, 24, 123-140.
5. Breiman, L. (1996b) Heuristics of instability and stabilization in model selection. Annals of Statistics, 24, 2350-2383.
6. Breiman, L. (1996c) Technical note: some properties of splitting criteria. Machine Learning, 24, 41-47.
7. Breiman, L. (1998) Arcing classifiers. Annals of Statistics, 26, 801-849.
8. Breiman, L. (2001) Random forests. Machine Learning, 45, 5-32.
9. Breiman, L., Friedman, J.H., Olshen, R.A. and Stone, C.J. (1984) Classification and Regression Trees. Belmont, CA: Wadsworth.
10. Briand, B., Ducharme, G.R., Parache, V. and Mercat-Rommens, C. (2009) A similarity measure to assess the stability of classification trees. Computational Statistics & Data Analysis, 53, 1208-1217.
11. Bühlmann, P. and Hothorn, T. (2010) Twin boosting: Improved feature selection and prediction. Statistics and Computing, 20, 119-138.
12. Cappelli, C., Mola, F. and Siciliano, R. (2002) A statistical approach to growing a reliable honest tree. Computational Statistics & Data Analysis, 38, 285-299.
13. Clark, P. and Niblett, T. (1989) The CN2 induction algorithm. Machine Learning, 3, 261-283.
14. Clémençon, S., Depecker, M. and Vayatis, N. (2011) Adaptive partitioning schemes for bipartite ranking. How to grow and prune a ranking tree. Machine Learning, 83, 31-69.
15. Conversano, C. and Siciliano, R. (2009) Incremental tree-base imputation with lexicographic ordering. Journal of Classification, 26, 361-379.
16. Dannegger, F. (2000) Tree stability diagnostics and some remedies for instability. Statistics in Medicine, 19, 475-491.
17. Donoho, D.L. (1997) CART and best-ortho-basis: a connection. Annals of Statistics, 25, 1870-1911.
18. Esposito, F., Malerba, D. and Semeraro, G. (1997) A comparative analysis of methods for pruning decision trees. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19, 476-491.
19. Fierens, D., Ramon, J., Blockeel, H. and Bruynooghe, M. (2010) A comparison of pruning criteria for probability trees. Machine Learning, 78, 251-285.
20. Friedman, J.H. (2001) Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29, 1189-1232.
21. Freund, Y. and Schapire, R. (1996) Experiments with a new boosting algorithm. In L. Saitta (ed.), Machine Learning: Proceedings of the Thirteenth International Conference, pp. 148-156. San Francisco: Morgan Kaufmann.
22. Gentle, J.E., Härdle, W. and Mori, Y. (eds) (2004) Handbook of Computational Statistics: Concepts and Methods. Berlin: Springer.
23. Gini, C. (1954) Variabilità e Concentrazione . Roma: Veschi, Italy.
24. Good, P. (2000) Permutation Tests: A Practical Guide to Resampling Methods for Testing Hypotheses, 2nd edn. New York: Springer.
25. Hastie, T., Tibshirani, R. and Friedman, J.H. (2009) The Elements of Statistical Learning, 2nd edn. New York: Springer.
26. Hothorn, T., Hornik, K. and Zeileis, A. (2006) Unbiased recursive partitioning: A conditional inference framework. Journal of Computational and Graphical Statistics, 15, 651-674.
27. Hush, D. and Porter, R. (2010) Algorithms for optimal dyadic decision trees. Machine Learning, 80, 85-107.
28. Kass, G.V. (1980) An exploratory technique for investigating large quantities of categorical data. Applied Statistics, 29, 119-127.
29. Kim,H.andLoh,W.Y.(2001)Classificationtreeswithunbiasedmultiwaysplits. Journal of the American Statistical Association, 96, 589-604.
30. LeBlanc, M. and Crowley, J. (1992) Relative risk trees for censored survival data. Biometrics, 48, 411-425.
31. Loh, W.Y. (2011) Classification and regression trees. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, 1, 14-23.
32. Loh, W.Y. and Vanichsetakul, N. (1988) Tree-structured classification via generalized discriminant analysis. Journal of the American Statistical Association, 83, 715-725.
33. Miglio, R. and Soffritti, G. (2003) Methods to combine classification trees. In M. Schader, W. Gaul and M. Vichi (eds), Between Data Science and Applied Data Analysis, pp. 65-73. Berlin: Springer.
34. Miglio, R. and Soffritti, G. (2004) The comparison between classification trees through proximity measures. Computational Statistics & Data Analysis, 45, 577-593.
35. Mingers, J. (1987) Expert systems rule induction with statistical data. Journal of the Operational Research Society, 28, 39-47.
36. Mola, F. and Siciliano, R. (1997) A fast splitting procedure for classification trees. Statistics and Computing, 7, 209-216.
37. Morgan, J.N. and Sonquist, J.A. (1963a) Problems in the analysis of survey data, and a proposal. Journal of the American Statistical Association, 58, 415-434.
38. Morgan, J.N. and Sonquist, J.A. (1963b) Some results from a non-symmetrical branching process that looks for interaction effects. Proceedings of the Social Statistics Section of the ASA, 58, 40-53.
39. Murthy, S.K. (1998) Automatic construction of decision trees from data: A multi-disciplinary survey. Data Mining and Knowledge Discovery, 2, 345-389.
40. Niblett, T. and Bratko, I. (1986) Learning decision rules in noisy domains. In Proceedings in Expert Systems 86, pp. 25-34. Cambridge: Cambridge University Press.
41. Nicolini, G. and Salini, S. (2006) Customer satisfaction in the airline industry: The case of British Airways. Quality and Reliability Engineering International, 22, 581-589.
42. Noh, H.G., Song, M.S. and Park, S.H. (2004) An unbiased method for constructing multilabel classification trees. Computational Statistics & Data Analysis, 47, 149-164.
43. Piccarreta, R. (2008) Classification trees for ordinal variables. Computational Statistics, 23, 407-427.
44. Quinlan, J.R. (1993) C4.5: Programs for Machine Learning. San Mateo, CA: Morgan Kaufmann.
45. R Development Core Team (2008) R: A Language and Environment for Statistical Computing. Vienna: R Foundation for Statistical Computing.
46. Sandri, M. and Zuccolotto, P. (2010) Analysis and correction of bias in total decrease in node impurity measures for tree-based algorithms. Statistics and Computing, 20, 393-407.
47. Segal, M.R. (1988) Regression trees for censored data. Biometrics, 44, 35-47.
48. Shalev-Shwartz, S. and Singer, Y. (2010) On the equivalence of weak learnability and linear separability: New relaxations and efficient boosting algorithms. Machine Learning, 80, 141-163.
49. Shannon, W.D. and Banks, D. (1999) Combining classification trees using MLE. Statistics in Medicine, 18, 727-740.
50. Siciliano, R. and Mola, F. (2000) Multivariate data analysis and modeling through classification and regression trees. Computational Statistics & Data Analysis, 32, 285-301.
51. Siciliano, R. and Conversano, C. (2009) Decision tree induction. In J. Wang (ed.), Encyclopedia of Data Warehousing and Data Mining, pp. 624-630. Hershey, PA: Information Science Reference.
52. Siciliano, R., Aria, M. and D'Ambrosio, A. (2008) Posterior prediction modelling of optimal trees. In P. Brito (ed.), Proceedings in Computational Statistics (COMPSTAT 2008), pp. 323-334. Heidelberg: Physica-Verlag.
53. Strasser, H. and Weber, C. (1999) On the asymptotic theory of permutation statistics. Mathematical Methods of Statistics, 8, 220-250.
54. Therneau, T.M. and Atkinson, E.J. (1997) An introduction to recursive partitioning using the rpart routines. Technical report 61, Mayo Foundation.
55. Tutore, V.A., Siciliano, R. and Aria, M. (2007) Conditional classification trees using instrumental variables. In M.R. Berthold, J. Shawe-Taylor J. and N. Lavrač (eds), Advances in Intelligent Data Analysis VII, Lecture Notes in Computer Science 4723, pp. 163-173. Berlin: Springer.
56. Zhang, H. (1998) Classification trees for multiple binary responses. Journal of the American Statistical Association, 93, 180-193.
57. Zhang, H. and Singer, B.H. (2010) Recursive Partitioning and Applications, 2nd edn. New York: Springer.
58. Zhang, H. and Ye, Y. (2008) A tree-based method for modeling a multivariate ordinal response. Statistics and Its Interface, 1, 169-178.
59. Zhong, M., Georgiopoulos, M. and Anagnostopoulos, G.C. (2008). A k-norm pruning algorithm for decision tree classifiers based on error rate estimation. Machine Learning, 71, 55-88.