Communications for Statistical Applications and Methods

The Korean Statistical Society (한국통계학회)
권호 표지
DOI QR코드

DOI QR Code

Simple Graphs for Complex Prediction Functions

  • Published : 2008.05.30
Download PDF
⟨ Previous Next ⟩

Abstract

By supervised learning with p predictors, we frequently obtain a prediction function of the form $y\;=\;f(x_1,...,x_p)$. When $p\;{\geq}\;3$, it is not easy to understand the inner structure of f, except for the case the function is formulated as additive. In this study, we propose to use p simple graphs for visual understanding of complex prediction functions produced by several supervised learning engines such as LOESS, neural networks, support vector machines and random forests.

Keywords

References

  1. Breiman, L. (2001). Random forests, Machine Learning, 45, 5-32 https://doi.org/10.1023/A:1010933404324
  2. Brownlee, K. A. (1960). Statistical Theory and Methodology in Science and Engineering, Jhon Wiley & Sons, New York
  3. Cleveland, W. S., Grosse, E. and Shyu, W. M. (1992). Local regression models, Chapter 8 of Statistical Models in S (eds by J.M. Chambers and T.J. Hastie), Wadsworth &Brooks/Cole
  4. Friedman, J. H. and Popescu, B. E. (2005). Predictive learning via rule ensembles, Technical Report, Department of Statistics, Stanford University
  5. Jiang, T. and Owen, A. B. (2002). Quasi-regression for visualization and interpretation of black box functions, Technical Report, Department of Statistics, Stanford University
  6. Kim, J. H. (2008). A graphical method of checking the adequacy of linear systematic component in generalized linear models, Communications of the Korean Statistical Society, 15, 27-41 https://doi.org/10.5351/CKSS.2008.15.1.027
  7. Ripley, B. D. (1996). Pattern Recognition and Neural Networks, Cambridge University Press, Cambridge