Projection Pursuit regression (PPR) approximates a regression function f(X ) by a ΓΏnite sum of ridge functions L l=1 f l ( T l X ). When the explanatory vector X is normally distributed, Johansen and Johnstone (1990) gave an one-term approximation formula to the signiΓΏcance level of a test of H0: f=
Connectionist projection pursuit regression
β Scribed by William Verkooijen; Hennie Daniels
- Publisher
- Springer US
- Year
- 1994
- Tongue
- English
- Weight
- 409 KB
- Volume
- 7
- Category
- Article
- ISSN
- 1572-9974
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The original Self-Organizing Map (SOM) algorithm is known to perform poorly on regression problems due to the occurrence of nonfunctional mappings. Recently, we have introduced an unsupervised learning rule, called the Maximum Entropy learning Rule (MER), which performs topographic map formation wit
The idea of searching for orthogonal projections, from a multidimensional space into a linear subspace, as an aid to detecting non-linear structure has been named exploratory projection pursuit. Most approaches are tied to the idea of searching for interesting projections. Typically, an interesting