Algorithmcore
Classical MDS
Also called Torgerson scaling, principal coordinates analysis.
Double-centre the squared distance matrix and take its top eigenvectors, which is exact for Euclidean distances.
Double-centre the squared distance matrix and take its top eigenvectors, which is exact for Euclidean distances.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag H05ZK6 Edit this page History Report an error