Generalized cross-validation (GCV) is a widely used parameter selection criterion for spline smoothing, but it can give poor results if the sample size n is not sufficiently large. An effective way to overcome this is to use the more stable criterion called robust GCV (RGCV). The main computational
โฆ LIBER โฆ
AnL1smoothing spline algorithm with cross validation
โ Scribed by Ken W. Bosworth; Upmanu Lall
- Publisher
- Springer US
- Year
- 1993
- Tongue
- English
- Weight
- 558 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1017-1398
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Efficient algorithms for robust generali
โ
Mark A. Lukas; Frank R. de Hoog; Robert S. Anderssen
๐
Article
๐
2010
๐
Elsevier Science
๐
English
โ 278 KB
Surface approximation by spline smoothin
โ
Hongmin Lu; Frank H. Mathis
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 505 KB
Lu, H. and F.H. Mathis, Surface approximation by spline smoothing and generalized cross-validation, Mathematics and Computers in Simulation 34 (1992) 541-549. A technique is developed to approximate multi-dimensional surfaces based on smoothing splines. The tensor product is used to extend a one-di
Denoising of spectra with no user input:
โ
Christopher J. Rowlands; Stephen R. Elliott
๐
Article
๐
2011
๐
John Wiley and Sons
๐
English
โ 587 KB
A convergent algorithm for quantile regr
โ
Ronald J. Bosch; Yinyu Ye; George G. Woodworth
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 858 KB
Algorithms for smoothing data with perio
โ
P Dierckx
๐
Article
๐
1982
๐
Elsevier Science
โ 687 KB
Algorithms for smoothing data with perio
โ
P. Dierckx
๐
Article
๐
1982
๐
Elsevier Science
โ 82 KB