In this paper we consider the problem of finding a set of monomials O and a polynomial f whose support is contained in O, such that (1) f is almost vanishing at a set of points X whose coordinates are not known exactly and (2) O exhibits structural stability, that is the model/design matrix associated to O is full rank for each set of points differing only slightly from X. We review some numerical versions of the Buchberger- Moller (BM) algorithm for computing the set O and the polynomial f and we present a variant, called LDP-LP, which integrates one of these methods with a classical statistical least squares algorithm for implicit regression from . To illustrate the usefulness of these numerical BM algorithms, we review some of their application in the analyses of data sets for which standard techniques did not yield satisfactory results.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
|Titolo:||BM algorithms for noisy data and implicit regression modelling|
|Data di pubblicazione:||2017|
|Appare nelle tipologie:||04.01 - Contributo in atti di convegno|