Comparative analysis for robust penalized spline smoothing methods (Q1718843)

From MaRDI portal





scientific article; zbMATH DE number 7016931
Language Label Description Also known as
default for all languages
No label defined
    English
    Comparative analysis for robust penalized spline smoothing methods
    scientific article; zbMATH DE number 7016931

      Statements

      Comparative analysis for robust penalized spline smoothing methods (English)
      0 references
      0 references
      0 references
      0 references
      8 February 2019
      0 references
      Summary: Smoothing noisy data is commonly encountered in engineering domain, and currently robust penalized regression spline models are perceived to be the most promising methods for coping with this issue, due to their flexibilities in capturing the nonlinear trends in the data and effectively alleviating the disturbance from the outliers. Against such a background, this paper conducts a thoroughly comparative analysis of two popular robust smoothing techniques, the \(M\)-type estimator and \(S\)-estimation for penalized regression splines, both of which are reelaborated starting from their origins, with their derivation process reformulated and the corresponding algorithms reorganized under a unified framework. Performances of these two estimators are thoroughly evaluated from the aspects of fitting accuracy, robustness, and execution time upon the MATLAB platform. Elaborately comparative experiments demonstrate that robust penalized spline smoothing methods possess the capability of resistance to the noise effect compared with the nonrobust penalized LS spline regression method. Furthermore, the \(M\)-estimator exerts stable performance only for the observations with moderate perturbation error, whereas the \(S\)-estimator behaves fairly well even for heavily contaminated observations, but consuming more execution time. These findings can be served as guidance to the selection of appropriate approach for smoothing the noisy data.
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers