Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.

  

A Kalman filtering algorithm for regularization networks

Author(s):

G. De Nicolao, G. Ferrari-Trecate
Conference/Journal:

American Control Conference, Chicago, USA
Abstract:

Regularization networks are nonparametric estimators obtained from the application of Tychonov regularization or Bayes estimation to the hypersurface reconstruction problem. With the usual algorithm, the computation of the weights scales as $O(n^{3})$ where $n$ is the number of data. In this paper we show that for a class of monodimensional problems, the complexity can be reduced to $O(n)$ by a suitable algorithm based on spectral factorization and Kalman filtering. The procedure applies also to smoothing splines and, in a multidimensional context, to additive regularization networks.

Year:

2000
Type of Publication:

(01)Article
Supervisor:



File Download:

Request a copy of this publication.
(Uses JavaScript)
% Autogenerated BibTeX entry
@InProceedings { NicFer:2000:IFA_123,
    author={G. De Nicolao and G. Ferrari-Trecate},
    title={{A Kalman filtering algorithm for regularization networks}},
    booktitle={American Control Conference},
    pages={},
    year={2000},
    address={Chicago, USA},
    month=jun,
    url={http://control.ee.ethz.ch/index.cgi?page=publications;action=details;id=123}
}
Permanent link