An automatic spline-knot allocation algorithm uses midpoint and integral error checks, plus a statistical refinement heuristic, to approximate functions to a user-chosen tolerance.
Spline Regression with Automatic Knot Selection
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this paper we introduce a new method for automatically selecting knots in spline regression. The approach consists in setting a large number of initial knots and fitting the spline regression through a penalized likelihood procedure called adaptive ridge. The proposed method is similar to penalized spline regression methods (e.g. P-splines), with the noticeable difference that the output is a sparse spline regression with a small number of knots. We show that our method called A-spline, for adaptive splines yields sparse regression models with high interpretability, while having similar predictive performance similar to penalized spline regression methods. A-spline is applied both to simulated and real dataset. A fast and publicly available implementation in R is provided along with this paper.
citation-role summary
citation-polarity summary
fields
astro-ph.IM 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
AutoKnots: Adaptive Knot Allocation for Spline Interpolation
An automatic spline-knot allocation algorithm uses midpoint and integral error checks, plus a statistical refinement heuristic, to approximate functions to a user-chosen tolerance.