Regularization Algorithm (also called Regularization Network) is a technique for solving problems of learning from examples - in particular, the problem of approximating a multivariate function from sparse data. We analyze behavior of Regularization Algorithm for regularizator parameter equal to zero. We propose an approximative version of algorithm in order to overcome the computational cost for large data sets. We give proof of convergence and estimation for error of approximation.
CITATION STYLE
Jaworski, W. (2004). A note on the regularization algorithm. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3066, pp. 235–243). Springer Verlag. https://doi.org/10.1007/978-3-540-25929-9_28
Mendeley helps you to discover research relevant for your work.