A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space
暂无分享,去创建一个
[1] M. Kendall. A course in multivariate analysis , 1958 .
[2] Richard C. T. Lee,et al. A Heuristic Relaxation Method for Nonlinear Mapping in Cluster Analysis , 1973, IEEE Trans. Syst. Man Cybern..
[3] R. Fisher. THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS , 1936 .
[4] Harry C. Andrews,et al. Nonlinear Intrinsic Dimensionality Computations , 1974, IEEE Transactions on Computers.
[5] M. O. Dayhoff. Computer analysis of protein evolution. , 1969, Scientific American.
[6] R. Prim. Shortest connection networks and some generalizations , 1957 .
[7] John W. Sammon,et al. A Nonlinear Mapping for Data Structure Analysis , 1969, IEEE Transactions on Computers.
[8] Richard C. T. Lee,et al. Application of game tree searching techniques to sequential pattern recognition , 1971, CACM.
[9] J. Hartigan. Direct Clustering of a Data Matrix , 1972 .
[10] Charles T. Zahn,et al. Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.
[11] J. Gower,et al. Minimum Spanning Trees and Single Linkage Cluster Analysis , 1969 .
[12] James R. Slagle. Artificial intelligence : the heuristic programming approach , 1971 .
[13] W. W. Bledsoe,et al. Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub. , 1971, SGAR.