A Projection Pursuit Algorithm for Exploratory Data Analysis
暂无分享,去创建一个
[1] R. Fisher. THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS , 1936 .
[2] C. Q. Lee,et al. The Computer Journal , 1958, Nature.
[3] H. H. Rosenbrock,et al. An Automatic Method for Finding the Greatest or Least Value of a Function , 1960, Comput. J..
[4] M. J. D. Powell,et al. An efficient method for finding the minimum of a function of several variables without calculating derivatives , 1964, Comput. J..
[5] James E. Dammann,et al. A Technique for Determining and Coding Subclasses in Pattern Recognition Problems , 1965, IBM J. Res. Dev..
[6] M. J. Box. A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems , 1966, Comput. J..
[7] John W. Sammon,et al. A Nonlinear Mapping for Data Structure Analysis , 1969, IEEE Transactions on Computers.
[8] J. Kruskal. 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” , 1969 .
[9] John W. Sammon,et al. An Optimal Discriminant Plane , 1970, IEEE Transactions on Computers.
[10] J. Ballam,et al. Van Hove Analysis of the Reactionsπ−p→π−π−π+pandπ+p→π+π+π−pat 16 GeV/c , 1971 .
[11] Charles T. Zahn,et al. Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.
[12] R. Brent. Table errata: Algorithms for minimization without derivatives (Prentice-Hall, Englewood Cliffs, N. J., 1973) , 1975 .