Approximation Using Cubic B-Splines with Improved Training Speed and Accuracy
- 192 Downloads
When using cubic B-splines, the quality of approximation depends on the placement of the knots. This paper describes the practical application of a new method for the selection of knot densities. Using a filtering and merging algorithm to split the input space into distinct regions, the number of equidistant knots in each subdivision of the space can be calculated in order to keep the approximation error below a predefined limit. In addition to the smoothing of the error surface, the technique also has the advantage of reducing the computational cost of calculating the spline approximation parameters.
Key WordsSplines knot placement approximation error
Unable to display preview. Download preview PDF.
- J.D. Mason, R.J. Craddock, K. Warwick, J.C. Mason and P.C. Parks, Local vs. Global Functions for System Identification, Computer-Intensive Methods in Control and Signal Processing, Prague, Czech Republic, 1994.Google Scholar
- K. Hlavácková and M. Verleysen, Placement of Knots in Approximation of Functions by Neural Networks Using Spline Activation Functions-Synthesis,Submitted to NeurocomputingGoogle Scholar