Smoothing noisy data with spline functions
By Michael F. Hutchinson, F. Hoog. 1985
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- James O. Ramsay
- J. Urgen Schmidhuber
- Nancy E. Heckman
- David R Ha
- Yoshua Bengio
- Sergey Levine
- Quoc V. Le
- Chelsea Finn
Citations in the corpus
- Deep learning in neural networks: An overview (2014, methodology): “Often weight priors are implicit in additional penalty terms (MacKay, 1992) or in methods based on validation sets (Craven & Wahba, 1979; Eubank, 1988; Golub, Heath, & Wahba, 1979; Hastie & Tibshirani, 1990; Mosteller & Tukey, 1968; Stone, 1974), Akaike’s information criterion and final prediction…”
- Penalized regression with model‐based penalties (2000, methodology): “In defense of the Kalman-lter approach, however, Kohn & Ansley (1993) found that, for the L = D 2 case, the approach is at least competitive with the widely available cubic smoothing spline method of Reinsch (1967, 1971) and Hutchison & de Hoog (1985) .”