Measuring the Stability of Results From Supervised Statistical Learning. Issue 4 (2nd October 2018)

• Record Type: Journal Article
• Authors: Philipp, Michel; Rusch, Thomas; Hornik, Kurt; Strobl, Carolin
• Is Part Of: Journal of computational and graphical statistics. Volume 27:Issue 4(2018)
• Page Start: 685
• Page End: 700
• Publication Date: 2018-10-02
• Subjects: Recursive partitioning -- Resampling -- package stablelearner; Mathematical statistics -- Data processing -- Periodicals; Mathematical statistics -- Graphic methods -- Periodicals; 519.50285
• DOI: 10.1080/10618600.2018.1473779
• Languages: English
• ISSNs: 1061-8600

Abstract

ABSTRACT: Stability is a major requirement to draw reliable conclusions when interpreting results from supervised statistical learning. In this article, we present a general framework for assessing and comparing the stability of results, which can be used in real-world statistical learning applications as well as in simulation and benchmark studies. We use the framework to show that stability is a property of both the algorithm and the data-generating process. In particular, we demonstrate that unstable algorithms (such as recursive partitioning) can produce stable results when the functional form of the relationship between the predictors and the response matches the algorithm. Typical uses of the framework in practical data analysis would be to compare the stability of results generated by different candidate algorithms for a dataset at hand or to assess the stability of algorithms in a benchmark study. Code to perform the stability analyses is provided in the form of an R package. Supplementary material for this article is available online.