z-logo
open-access-imgOpen Access
Robust nonlinear data smoothers: Definitions and recommendations
Author(s) -
Paul F. Velleman
Publication year - 1977
Publication title -
proceedings of the national academy of sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 5.011
H-Index - 771
eISSN - 1091-6490
pISSN - 0027-8424
DOI - 10.1073/pnas.74.2.434
Subject(s) - computer science , nonlinear system , parametric statistics , set (abstract data type) , monte carlo method , data set , series (stratigraphy) , smoothing , data mining , algorithm , noise (video) , mathematical optimization , artificial intelligence , mathematics , statistics , biology , paleontology , physics , quantum mechanics , image (mathematics) , computer vision , programming language
Nonlinear data smoothers provide a practical method of finding smooth traces for data confounded with possibly long-tailed or occasionally "spikey" noise. While they are natural tools for analyzing time-series data, they can be applied to any data set for which a sequencing order can be established. Their resistance to the effects of unsupported extreme observations and their ability to respond rapidly to well-supported patterns make them valuable as tools for finding patterns not constrained to specific parametric form and as versatile data-cleaning algorithms. This paper defines some robust nonlinear smoothers that have performed well in Monte-Carlo trials and makes brief recommendations based upon that study.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom