zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
On projection pursuit regression. (English) Zbl 0698.62041
A mathematical model of projection pursuit regression based on kernel estimation (of “marginal density of errors in projection direction”) is proposed and the necessary mathematical calculus for projection approximation of the target function $G(X)=E Y$ is built up. The main results are explicit formulae for bias and error about the mean in orientation estimates and curve estimates. They show that the estimate of orientation (of projection) has most its error in the form of bias. They also prove that the kernel-based projection pursuit regression does estimate corresponding projections with convergence rates identical to those known from one-dimensional estimation, namely $O(h\sp r)=O((nh)\sp{-1/2})$ (h being the bandwidth of kernel estimator). The estimator of G(x) based on projections to the direction $\theta$ (say $\hat G\sb{\theta}(x))$ is required to minimize $$ \hat S(\theta)=n\sp{- 1}\sum\sp{n}\sb{k=1}(Y\sb k-\hat G\sb{\theta}(x\sb k))\sp 2 $$ (where $(Y\sb k,X\sb k)\sp n\sb{k=1}$, $Y\sb k\in R$, $X\sb k\in R\sp p$ are data). The main idea how to construct $\hat G\sb{\theta}(x)$ is to do it through estimating $\theta$ by ${\hat \theta}$ which minimizes $$ \tilde S(\theta)=n\sp{-1}\sum\sp{n}\sb{k=1}(Y\sb k-\hat G\sp k\sb{\theta}(x\sb k))\sp 2 $$ where $\hat G\sp k\sb{\theta}(x\sb k)$ is the nonparametric (kernel) estimate of G(x) based on all points $(x\sb i)\sp n\sb{i=1}$ except of $x\sb k$. At the end, some alternative approaches (with randow window, two-stage algorithm etc.) are discussed.
Reviewer: J.Á.Víšek

62G05Nonparametric estimation
62H99Multivariate analysis
62H05Characterization and structure theory (Multivariate analysis)
Full Text: DOI