Sammon mapping
This article may meet Wikipedia's criteria for speedy deletion as a very short article lacking sufficient context to identify the subject of the article. See CSD A1.
If this article does not meet the criteria for speedy deletion, or you intend to fix it, please remove this notice, but do not remove this notice from pages that you have created yourself. If you created this page and you disagree with the given reason for deletion, you can click the button below and leave a message explaining why you believe it should not be deleted. You can also visit the talk page to check if you have received a response to your message. Note that this article may be deleted at any time if it unquestionably meets the speedy deletion criteria, or if an explanation posted to the talk page is found to be insufficient.
Note to administrators: this article has content on its talk page which should be checked before deletion. Administrators: check links, talk, history (last), and logs before deletion. Consider checking Google.This page was last edited by 24.148.164.15 (contribs | logs) at 23:22, 12 March 2010 (UTC) (15 years ago) |
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.