Sammon mapping

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Sammon mapping or Sammon projection is an algorithm that maps a high-dimensional space to a space of lower dimensionality (see multidimensional scaling) by trying to preserve the structure of inter-point distances in high-dimensional space in the lower-dimension projection.[1]

It is particularly suited for use in exploratory data analysis.

The method was proposed by John W. Sammon in 1969.[2]

It is considered a non-linear approach as the mapping cannot be represented as a linear combination of the original variables as possible in techniques such as principal component analysis, which also makes it more difficult to use for classification applications.[3]

Denote the distance between ith and jth objects in the original space by , and the distance between their projections by .

Sammon's mapping aims to minimize the following error function, which is often referred to as Sammon's stress or Sammon's error:

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

The number of iterations needs to be experimentally determined and convergent solutions are not always guaranteed.

Many implementations prefer to use the first Principal Components as a starting configuration.[4]

The Sammon mapping has been one of the most successful nonlinear metric multidimensional scaling methods since its advent in 1969, but effort has been focused on algorithm improvement rather than on the form of the stress function.

The performance of the Sammon mapping has been improved by extending its stress function using left Bregman divergence [5] and right Bregman divergence.[6]

See also[edit]


  1. ^ Jeevanandam, Nivash (2021-09-13). "Underrated But Fascinating ML Concepts #5 – CST, PBWM, SARSA, & Sammon Mapping". Analytics India Magazine. Retrieved 2021-12-05.
  2. ^ Sammon JW (1969). "A nonlinear mapping for data structure analysis" (PDF). IEEE Transactions on Computers. 18 (5): 401, 402 (missing in PDF), 403–409. doi:10.1109/t-c.1969.222678.
  3. ^ Lerner, B; Hugo Guterman, Mayer Aladjem, Itshak Dinsteint, Yitzhak Romem (1998). "On pattern classification with Sammon's nonlinear mapping an experimental study". Pattern Recognition. 31 (4): 371–381. doi:10.1016/S0031-3203(97)00064-2.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  4. ^ Lerner, B; H. Guterman, M. Aladjem and I. Dinstein (2000). "On the Initialisation of Sammon's Nonlinear Mapping". Pattern Analysis & Applications. 3 (2): 61–68. CiteSeerX doi:10.1007/s100440050006.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  5. ^ J. Sun, M. Crowe, C. Fyfe (May 2011). "Extending metric multidimensional scaling with Bregman divergences". Pattern Recognition. 44 (5): 1137–1154. doi:10.1016/j.patcog.2010.11.013.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  6. ^ J. Sun, C. Fyfe, M. Crowe (2011). "Extending Sammon mapping with Bregman divergences". Information Sciences. 187: 72–92. doi:10.1016/j.ins.2011.10.013.{{cite journal}}: CS1 maint: multiple names: authors list (link)

External links[edit]