Evaluation of Projection Algorithms

Authors:
Gautam Biswas;Anil K. Jain;Richard C. Dubes
Affiliations:
Department of Computer Science, Michigan State University, East Lansing, MI 48824.;Department of Computer Science, Michigan State University, East Lansing, MI 48824.;Department of Computer Science, Michigan State University, East Lansing, MI 48824.
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1981

Citing 0
Cited 3

Visualization of transformed multivariate data sets with autoassociative neural networks

Pattern Recognition Letters
Discrete camera calibration from pixel streams

Computer Vision and Image Understanding
The equal-angle spanning tree mapping: A sequential method for projecting from h-space to 2-space

Pattern Recognition Letters

Quantified Score

Hi-index	0.14

Visualization

Abstract

A number of linear and nonlinear mapping algorithms for the projection of patterns from a high-dimensional space to two dimensions are available. These two-dimensional representations allow quick visual observation of a data set. A combination of two popular mapping algorithms-Sammon's mean-square error technique and the triangulation method-is proposed to overcome the limitations in the individual algorithms. Some factors which describe the goodness of a projection are described, and a comparison is made of six of these algorithms by running them on four data sets. The results obtained support the use of the proposed algorithm.