In the kernel methods of Chapter 2, the estimator of a function is defined first and then a measure of precision is invoked to assess how close the estimator is to the true function. In this chapter, this is reversed. The starting point is a precision criterion, and the spline smoother is the result of minimizing it. Before presenting and developing the machinery of smoothing splines, it is worthwhile to introduce interpolating splines. This parallels the discussion of Early smoothers and the considerations leading to local smoothers, thereby giving insight into the formulation of smoothing splines. Like the kernel-based methods of the last chapter, splines suffer from the Curse of Dimensionality. Nevertheless, there is a parallel theory for multivariate splines. Eubank (1988), Chapter 6.2.3 touches on it with some references. Such Laplacian smoothing splines are neglected here, as are partial splines, which generalize splines to include an extra nonparametric component.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer-Verlag New York
About this chapter
Cite this chapter
Clarke, B., Fokoué, E., Zhang, H.H. (2009). Spline Smoothing. In: Principles and Theory for Data Mining and Machine Learning. Springer Series in Statistics. Springer, New York, NY. https://doi.org/10.1007/978-0-387-98135-2_3
Download citation
DOI: https://doi.org/10.1007/978-0-387-98135-2_3
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-98134-5
Online ISBN: 978-0-387-98135-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)