Metraipolis › archive › dc_d31aeac53fa0

Stress majorization — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Stress_majorization
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T14:23:36.365Z
SHA-256 of the archived text
8bbc1cebf2f3d79bd0f33fc27949a1aeff0c1b325022cf6fc8247b4072bb239f
Stable URL of this page
https://metraipolis.com/documento/dc_d31aeac53fa0

How to cite

Stress majorization — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Stress_majorization (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_d31aeac53fa0 (Metraipolis archive dc_d31aeac53fa0, sha256 8bbc1cebf2f3d79bd0f33fc27949a1aeff0c1b325022cf6fc8247b4072bb239f)
BibTeX
@misc{dcd31aeac53fa0,
  title = {Stress majorization — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Stress_majorization},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_d31aeac53fa0; sha256 8bbc1cebf2f3d79bd0f33fc27949a1aeff0c1b325022cf6fc8247b4072bb239f},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Stress_majorization. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Stress majorization is an optimization strategy used in multidimensional scaling (MDS) where, for a set of n {\displaystyle n} m {\displaystyle m} -dimensional data items, a configuration X {\displaystyle X} of n {\displaystyle n} points in r {\displaystyle r} ( ≪ m ) {\displaystyle (\ll m)} -dimensional space is sought that minimizes the so-called stress function σ ( X ) {\displaystyle \sigma (X)} . Usually r {\displaystyle r} is 2 {\displaystyle 2} or 3 {\displaystyle 3} , i.e. the ( n × r ) {\displaystyle (n\times r)} matrix X {\displaystyle X} lists points in 2 − {\displaystyle 2-} or 3 − {\displaystyle 3-} dimensional Euclidean space so that the result may be visualised (i.e. an MDS plot). The function σ {\displaystyle \sigma } is a cost or loss function that measures the squared differences between ideal ( m {\displaystyle m} -dimensional) distances and actual distances in r-dimensional space. It is defined as: σ ( X ) = ∑ i < j ≤ n w i j ( d i j ( X ) − δ i j ) 2 {\displaystyle \sigma (X)=\sum _{i<j\leq n}w_{ij}(d_{ij}(X)-\delta _{ij})^{2}} where w i j ≥ 0 {\displaystyle w_{ij}\geq 0} is a weight for the measurement between a pair of points ( i , j ) {\displaystyle (i,j)} , d i j ( X ) {\displaystyle d_{ij}(X)} is the euclidean distance between i {\displaystyle i} and j {\displaystyle j} and δ i j {\displaystyle \delta _{ij}} is the ideal distance between the points (their separation) in the m {\displaystyle m} -dimensional data space. Note that w i j {\displaystyle w_{ij}} can be used to specify a degree of confidence in the similarity between points (e.g. 0 can be specified if there is no information for a particular pair). A configuration X {\displaystyle X} which minimizes σ ( X ) {\displaystyle \sigma (X)} gives a plot in which points that are close together correspond to points that are also close together in the original m {\displaystyle m} -dimensional data space. There are many ways that σ ( X ) {\displaystyle \sigma (X)} could be minimized. For example, Kruskal recommended an iterative steepest descent approach. However, a significantly better (in terms of guarantees on, and rate of, convergence) method for minimizing stress was introduced by Jan de Leeuw. De Leeuw's iterative majorization method at each step minimizes a simple convex function which both bounds σ {\displaystyle \sigma } from above and touches the surface of σ {\displaystyle \sigma } at a point Z {\displaystyle Z} , called the supporting point. In convex analysis such a function is called a majorizing function. This iterative majorization process is also referred to as the SMACOF algorithm ("Scaling by MAjorizing a COmplicated Function").

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Mathematical optimization»).
Fonte: Wikipedia in inglese, voce «Stress majorization» — https://en.wikipedia.org/wiki/Stress_majorization
Wikidata Q7623444 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q7623444
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Stress_majorization?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1322823371, consultata il 2026-10-07T14:06:35.521Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 5dc873ea8f6f1bddb0e66c2ad9f98718e3a8d31ee7162413074a75f6d6966ca5