A Projection Pursuit Algorithm for Exploratory Data Analysis

IEEE Transactions on Computers

Volumn C-23, Issue 9, 1974, Pages 881-890

  Friedman, Jerome H ^a   Tukey, John W ^b  

^a SLAC NATIONAL ACCELERATOR LABORATORY   (United States)

^b PRINCETON UNIVERSITY   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

Clustering; dimensionality reduction; mappings; multidimensional scaling; multivariate data analysis; nonparametric pattern recognition; statistics

Indexed keywords

DATA PROCESSING;

EID: 0016102310     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/T-C.1974.224051     Document Type: Article

References (18)

1. L. N. Bolshev, Bull. Int. Statist. Inst., vol. 43, pp. 411–425, 1969.
2. C. T. Zahn, “Graph-theoretical methods for detecting and describing gestalt clusters,” IEEE Trans. Comput., vol. C-20, pp. 68–86, Jan. 1971.
3. R. N. Shepard and J. D. Carroll, “Parametric representation of nonlinear data structures,” in Multivariate Analysis, P. Krishnaiah, Ed. New York: Academic, 1966.
4. J. W. Sammon, Jr., “A nonlinear mapping for data structure analysis,” IEEE Trans. Comput., vol. C-18, pp. 401–409, May 1969.
5. J. B. Kruskal, “Toward a practical method which helps un-cover the structure of a set of multivariate observations by finding the linear transformation which optimizes a new ‘index of condensation,’ “ in Statistical Computation, R. C. Milton and J. A. Nelder, Ed. New York: Academic, 1969.
6. J. B. Kruskal, “Linear transformation of multivariate data to reveal clustering,” in Multidimensional Scaling: Theory and Application in the Behavorial Sciences, vol. 1, Theory. New York and London: Seminar Press, 1972.
7. H. H. Rosenbrock, “An automatic method for finding the greatest or least value of a function,” Comput. J., vol. 3, pp. 175–184, 1960.
8. M. J. D. Powell, “An efficient method for finding the minimum of a function of several variables without calculating derivates,” Comput. J., vol. 7, pp. 155–162, 1964.
9. R. L. Maltson and J. E. Dammann, “A technique for determining and coding subclasses in pattern recognition problems,” IBM J., vol. 9, pp. 294–302, July 1965.
10. R. L. Maltson and J. E. Dammann, “PRIM-9,” film produced by Stanford Linear Accelerator Cen., Stanford, Calif., Bin 88 Productions, Apr. 1973.
11. J. H. Friedman and S. Steppel, “Nonlinear constraint elimination in high dimensionality through reversible transformations,” Stanford Linear Accelerator Cen., Stanford, Calif., Rep. SLAC PUB-1292, Aug. 1973.
12. S. Derenzo, “MINF-68——A general minimizing routine,” Lawrence Berkeley Lab., Berkeley, Calif., Group A Tech. Rep. P-190, 1969.
13. R. P. Brent, Algorithms for Minimization Without Derivatives. Englewood Cliffs, N. J.: Prentice-Hall, 1973.
14. G. H. Golub, “Numerical methods for solving linear least squares problems,” Numer. Math., vol. 7, pp. 206–216, 1965.
15. R. A. Fisher, “Multiple measurements in taxonomic problems,” in Contributions to Mathematical Statistics. New York: Wiley.
16. J. W. Sammon, Jr., “An optimal discriminant plane,” IEEE Trans. Comput., vol. C-19, pp. 826–829, Sept. 1970.
17. J. Ballam, G. B. Chadwick, Z. C. G. Guiragossian, W. B. Johnson, D. W. G. S. Leith, and K. Moriyasu, “Van Hove analysis of the reactions π - p →π - π - π + p and π + p π + p→π + π + π - p at 16 GeV/C,” Phys. Rev., vol. 4, pp. 1946–1947, Oct. 1971.
18. M. J. Box, Comput. J., vol. 9, pp. 67–77, 1966.