A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space

IEEE Transactions on Computers

Volumn C-26, Issue 3, 1977, Pages 288-292

  Lee, R C T ^a   Slagle, J R ^b   Blum, H ^c  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b NAVAL RESEARCH LABORATORY   (United States)

^c NATIONAL INSTITUTES OF HEALTH   (United States)

Author keywords

Clustering analysis; Distance preserving; Minimal spanning tree; Nonlinear mapping; Principal component analysis; Reference point approach; Second nearest neighbor approach; Tree searching

Indexed keywords

STATISTICAL METHODS;

MATHEMATICAL TECHNIQUES;

EID: 0017471365     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1977.1674822     Document Type: Article

References (15)

1. C. L. Chang and R. C. T. Lee, “A heuristic relaxation method for nonlinear mapping in cluster analysis,” IEEE Trans. Syst., Man, Cybern., vol. SMC-3, pp. 197–200, Mar. 1973.
2. C. K. Chen and H. C. Andrews, “Nonlinear intrinsic dimensionality computations,” IEEE Trans. Comput., vol. C-23, pp. 178–184, Feb. 1974.
3. W. W. Cooley and P. Lohnes, Multivariate Data Analysis. New York: Wiley, 1971.
4. M. O. Dayhoff, “Computer analysis of protein evolution,” Sci. Amer., pp. 86–95, July 1969.
5. R. A. Fisher, “The use of multiple measurements in taxanomic problems,” Ann. Eugen., vol. 7, pp. 178–188, 1936.
6. J. C. Gower and G. J. S. Ross, “Minimum spanning trees and single linkage cluster analysis,” Appl. Stat., vol. 18, no. 1, pp. 54–64, 1969.
7. J. A. Hartigan, “Direct clustering of a data matrix,” J. Amer. Stat. Ass., vol. 67, no. 337, pp. 123–129, Mar. 1972.
8. M. G. Kendall, A Course in Multivariate Analysis. New York: Hefner, 1968.
9. N. J. Nilsson, Problem Solving Methods in Artificial Intelligence. New York: McGraw-Hill, 1971.
10. R. C. Prim, “Shortest connection network and some generalizations,” Bell Syst. Tech. J., pp. 1389–1401, Nov. 1957.
11. J. W. Sammon, Jr., “A nonlinear mapping for data structure analysis,” IEEE Trans. Comput., vol. C-18, pp. 401–409, May 1969.
12. R. Shepard and J. Carroll, “Parametric representation of nonlinear data structure,” in Proc. Int. Symp. on Multivariant Analysis, P. R. Krishnaiah, Ed. New York: Academic Press, 1966.
13. J. R. Slagle, Artificial Intelligence: A Heuristic Programming Approach. New York: McGraw-Hill, 1971.
14. J. R. Slage and R. C. T. Lee, “Applications of game tree searching techniques to sequential pattern recognition,” Commun. Assoc. Comput. Mach., vol. 14, no. 2, pp. 103–110, Feb. 1971.
15. C. T. Zahn, “Graph-theoretical methods for detecting and describing Gestalt clusters,” IEEE Trans. Comput., vol. C-20, pp. 68–86, Jan. 1971.