A Note on Projection Pursuit
نویسنده
چکیده
I provide a historic review of the forward and backward projection pursuit algorithms, previously thought to be equivalent, and point out an important difference between the two. In doing so, I correct a small error in the original exploratory projection pursuit paper (Friedman 1987). The implication of the difference is briefly discussed in the context of an application in which projection pursuit density estimation is used as a building block for non-parametric discriminant analysis.
منابع مشابه
انجام یک مرحله پیش پردازش قبل از مرحله استخراج ویژگی در طبقه بندی داده های تصاویر ابر طیفی
Hyperspectral data potentially contain more information than multispectral data because of their higher spectral resolution. However, the stochastic data analysis approaches that have been successfully applied to multispectral data are not as effective for hyperspectral data as well. Various investigations indicate that the key problem that causes poor performance in the stochastic approaches t...
متن کاملOn Exact Computation of Some Statistics Based on Projection Pursuit in a General Regression Context
It is shown in detail how recent advances in multiple-output and projectional quantile regression open the door to exact computation of many inferential statistics based on projection pursuit. This is also illustrated on a few examples including new regression generalizations of multivariate skewness, kurtosis and projection depth. Note: The following files were submitted by the author for peer...
متن کاملA note on lifting projections
Suppose $pi:mathcal{A}rightarrow mathcal{B}$ is a surjective unital $ast$-homomorphism between C*-algebras $mathcal{A}$ and $mathcal{B}$, and $0leq aleq1$ with $ain mathcal{A}$. We give a sufficient condition that ensures there is a proection $pin mathcal{A}$ such that $pi left( pright) =pi left( aright) $. An easy consequence is a result of [L. G. Brown and G. k. Pedersen, C*-algebras of real...
متن کاملCombining Exploratory Projection Pursuit and Projection Pursuit Regression with Application to Neural Networks
Parameter estimation becomes difficult in high-dimensional spaces due to the increasing sparseness of the data. Therefore, when a low-dimensional representation is embedded in the data, dimensionality reduction methods become useful. One such method-projection pursuit regression (Friedman and Stuetzle 1981 (PPR)-is capable of performing dimensionality reduction by composition, namely, it constr...
متن کاملOn the Use of Projection Pursuit Constraints for Training Neural Networks
\Ve present a novel classifica t.ioll and regression met.hod that combines exploratory projection pursuit. (unsupervised traiuing) with projection pursuit. regression (supervised t.raining), t.o yield a. nev,,' family of cost./complexity penalLy terms . Some improved generalization properties are demonstrat.ed on real \vorld problems.
متن کامل