Journal of Statistical Computation and Simulation · 2012 · 54 citations · 42 references
ComputingComputer ScienceHigh-performance ComputingAlgorithmsParallel ComputingScientific ComputingCurve FittingEvolutionary ComputationGenetic AlgorithmsMetaheuristic OptimizationMonte Carlo MethodsMonte Carlo SimulationGenetic Algorithm OptimizationPenalized Spline SmoothingSmoothing SplinesSpline EstimationSpline FittingSpline Knot SelectionSpline RegressionSpline Smoothing
Two new stochastic search methods are proposed for optimizing the knot locations and/or smoothing parameters for least-squares or penalized splines. One of the methods is a golden-section-augmented blind search, while the other is a continuous genetic algorithm. Monte Carlo experiments indicate that the algorithms are very successful at producing knot locations and/or smoothing parameters that are near optimal in a squared error sense. Both algorithms are amenable to parallelization and have been implemented in OpenMP and MPI. An adjusted GCV criterion is also considered for selecting both the number and location of knots. The method performed well relative to MARS in a small empirical comparison.
42
Multivariate Adaptive Regression Splines
Jerome H. Friedman · The Annals of Statistics · 1991 · 8.1K citations · Full text
Flexible smoothing with B-splines and penalties
Paul H.C. Eilers, Brian D. Marx · Statistical Science · 1996 · 3.7K citations · Full text
Smoothing noisy data with spline functions
Peter G. Craven, Grace Wahba · Numerische Mathematik · 1978 · 3.4K citations