A Projection Pursuit Algorithm for Exploratory Data Analysis

@article{Friedman1974APP,
  title={A Projection Pursuit Algorithm for Exploratory Data Analysis},
  author={Jerome H. Friedman and John W. Tukey},
  journal={IEEE Transactions on Computers},
  year={1974},
  volume={C-23},
  pages={881-890}
}
  • J. Friedman, J. Tukey
  • Published 1 September 1974
  • Mathematics, Computer Science
  • IEEE Transactions on Computers
An algorithm for the analysis of multivariate data is presented and is discussed in terms of specific examples. The algorithm seeks to find one-and two-dimensional linear projections of multivariate data that are relatively highly revealing. 

Figures, Tables, and Topics from this paper

Exploratory Projection Pursuit
“Projection Pursuit” (PP) stands for a class of exploratory projection techniques. This class contains methods designed for analyzing high dimensional data using low-dimensional projections. The mainExpand
A Neural Network for Feature Extraction
The paper suggests a statistical framework for the parameter estimation problem associated with unsupervised learning in a neural network, leading to an exploratory projection pursuit network thatExpand
Graphics for the Multivariate Two-Sample Problem
Abstract Some graphical methods for comparing multivariate samples are presented. These methods are based on minimal spanning tree techniques developed for multivariate two-sample tests. The utilityExpand
Projection Pursuit Regression
Abstract A new method for nonparametric multiple regression is presented. The procedure models the regression surface as a sum of general smooth functions of linear combinations of the predictorExpand
PROJECTION PURSUIT DENSITY ESTIMATION
Abstract The projection pursuit methodology is applied to the multivariate density estimation problem. The resulting nonparametric procedure is often less biased than the kernel and near-neighborExpand
Projection Pursuit-A Brief Introduction†
Projection pursuit was conceived as a method for finding ‘interesting’ one- or two-dimensional projections of multivariate data revealing unanticipated structure such as clusters, skewness, orExpand
An Algorithm with Projection Pursuit for Sliced Inverse Regression Model
In the paper, we investigate a conditional density function of sliced response variables and propose an algorithm for the sliced inverse regression (SIR) model with projection pursuit.
Manifold learning and representations for image analysis and visualization
We present a novel method for manifold learning, i.e. identification of the low-dimensional manifold-like structure present in a set of data points in a possibly high-dimensional space. The main idExpand
Subspace Optimization Techniques for Classification Problems
The nonlinear conjugate gradients method is a very powerful program in the search for Bayes error optimal linear subspaces for classification problems. In this report, techniques to find linear subExpand
The partially linear regression model: Monte Carlo evidence from the projection pursuit regression approach
Abstract In a partially linear regression model with a high dimensional unknown component we find an estimator of the parameter of the linear part based on projection pursuit methods to beExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 15 REFERENCES
A Nonlinear Mapping for Data Structure Analysis
  • J. Sammon
  • Computer Science
  • IEEE Transactions on Computers
  • 1969
An algorithm for the analysis of multivariate data is presented along with some experimental results. The algorithm is based upon a point mapping of N L-dimensional vectors from the L-space to aExpand
TOWARD A PRACTICAL METHOD WHICH HELPS UNCOVER THE STRUCTURE OF A SET OF MULTIVARIATE OBSERVATIONS BY FINDING THE LINEAR TRANSFORMATION WHICH OPTIMIZES A NEW “INDEX OF CONDENSATION”
Publisher Summary A major problem in data analysis is to find any structure in a set of multivariate observations. If each observation is represented as a point in multidimensional space, this meansExpand
An Optimal Discriminant Plane
  • J. Sammon
  • Computer Science
  • IEEE Transactions on Computers
  • 1970
TLDR
A piecewise linear method is described which is being used in the on-line pattern analysis and recognition system (OLPARS) and it is shown that it can be used to discriminate between vector samples from two classes. Expand
A Technique for Determining and Coding Subclasses in Pattern Recognition Problems
TLDR
This paper describes a method for detecting and coding clusters that needs not be known a priori and no matrix inversion is required. Expand
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
  • C. T. Zahn
  • Mathematics, Computer Science
  • IEEE Transactions on Computers
  • 1971
A family of graph-theoretical algorithms based on the minimal spanning tree are capable of detecting several kinds of cluster structure in arbitrary point sets; description of the detected clustersExpand
A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
TLDR
Transitions whereby inequality constraints of certain forms can be eliminated from the formulation of an optimization problem are described, and examples of their use compared with other methods for handling such constraints are described. Expand
Algorithms for Minimization Without Derivatives
  • 1972
Bull. Internat. Stat. Inst
  • Bull. Internat. Stat. Inst
  • 1969
...
1
2
...