Model-Based Recursive Partitioning
Achim Zeileis, Torsten Hothorn, Kurt Hornik · Journal of Computational and Graphical Statistics · 2008
Recursive partitioning is embedded into the general and well-established class of parametric models that can be fitted using M-type estimators (including maximum likelihood). An algorithm for model-based recursive partitioning is suggested for which the basic steps are: (1) fit a parametric model to a dataset; (2) test for parameter instability over a set of partitioning variables; (3) if there is some overall parameter instability, split the model with respect to the variable associated with the highest instability; (4) repeat the procedure in each of the daughter nodes. The algorithm yields a partitioned (or segmented) parametric model that can be effectively visualized and that subject-matter scientists are used to analyzing and interpreting.
Cited by 781 works. doi:10.1198/106186008x319331
Authors
References
- The Nature of Statistical Learning Theory
- Random Forests
- Classification and Regression Trees.
- Classification and Regression Trees.
- C4.5: Programs for Machine Learning
- Data Mining: Practical Machine Learning Tools and Techniques
- Pattern Recognition and Neural Networks
- UCI Repository of machine learning databases
- Data Mining
- Tests of Equality Between Sets of Coefficients in Two Linear Regressions