DocumentCode
1134437
Title
A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space
Author
Lee, R.C.T. ; Slagle, J.R. ; Blum, H.
Author_Institution
Institute of Applied Mathematics, National Tsing Hua University
Issue
3
fYear
1977
fDate
3/1/1977 12:00:00 AM
Firstpage
288
Lastpage
292
Abstract
A method for the sequential mapping of points in a high-dimensional space onto a plane is presented. Whenever a new point is mapped, its distgnces to two points previously mapped are exactly preserved. On the resulting map, 2M -3 of the original distances can be exactly preserved. The mapping is based on the distances of a minimal spanning tree constructed from the points. All of the distances on the minimal spanning tree are exactly preserved.
Keywords
Clustering analysis, distance preserving, minimal spanning tree, nonlinear mapping, principal component analysis, reference point approach, second nearest neighbor approach, tree searching.; Computer science; Covariance matrix; Decision trees; Displays; Laboratories; Mathematics; Microscopy; Multidimensional systems; Nearest neighbor searches; Principal component analysis; Clustering analysis, distance preserving, minimal spanning tree, nonlinear mapping, principal component analysis, reference point approach, second nearest neighbor approach, tree searching.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1977.1674822
Filename
1674822
Link To Document