Approximation Using Cubic B-Splines with Improved Training Speed and Accuracy



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 Words

Splines knot placement approximation error 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    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
  2. [2]
    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
  3. [3]
    M.H. Schultz Spline Analysis, Prentice—Hall, New Jersey, 1973zbMATHGoogle Scholar
  4. [4]
    L.L. Schumaker Spline Functions: Basic Theory, John Wiley and Sons, New York, 1981zbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

There are no affiliations available

Personalised recommendations