Jump to content

Sammon mapping

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Casablanca2000in (talk | contribs) at 15:52, 10 June 2010 (Stub-sorting. You can help!). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Sammon's projection, or Sammon's mapping is an algorithm that maps a high-dimensional space to a space of lower dimensionality (see multidimensional scaling).

Denote the distance between ith and jth objects in the original space by , and the distance between their projections by . Sammon's projection aims to minimize the following error function, which is often referred to as Sammon's stress:

The minimization can be performed either by gradient descent, as proposed initially, or by other means.

Software

Sammon's projection is supported by R (package MASS) and by SOM toolbox, a free functional package for Matlab. An implementation in C# can be found at CodeProject.

Bibliography

  • J. W. Sammon, Jr. "A nonlinear mapping for data structure analysis". IEEE Transactions on Computers, 18, pp. 401–409, 1969.