MDS sees only the travel times and draws a ring in driving order. With a long wait at the construction site, the ring becomes a line.
The entry \(d_{st}\) is the travel time between places \(s\) and \(t\). The outlined trips pass the construction site.
Here \(\mathbf D\) holds the 1,128 distances between the 48 state centres. MDS gets the shape right, but upside down.
Turning the map changes no distance.
So \(\mathbf D\) cannot tell which way is north.
It fixes the map only up to a turn and a flip.
None of the three turns changes a distance. So three facts are needed to pin the plane down.
The eigenvectors of \(\mathbf B\) give the map. However the map is turned (left), its PCA scores stay put (right). They are exactly the map that MDS returns.
Random pairing gives the roommates no order.
So their GPA axes lie at 45ยฐ to the axes of the cloud, and the map alone gives the peer effect, 0.20.
With an order, as in Cholesky, the map must first be turned into place.
Each state is a point in six dimensions, one per indicator. Mahalanobis distances remove the correlations, so the cloud turns round.
\(d_{st}\) is how many words apart \(s\) and \(t\) appear in a text, on average.
Coke and Pepsi are 3.2 words apart. Coke and runway are 22.6.
MDS turns these distances into coordinates, the embedding.
Each theme forms its own group. MDS was never told the themes.
One-hot encoding, by contrast, puts every two words the same distance apart.
A square gets either the sides or the diagonals right, never both. No number of dimensions helps.
A negative eigenvalue means that no map reproduces the table exactly.
As the wait grows, one eigenvalue takes over. From 27.9 minutes on, a line fits exactly.
Each point is one pair of observations. On a perfect map, all points lie on the diagonal.
It keeps only the order of the distances. For the loop road, that order fits a circle exactly.
MDS draws the map that a table of distances describes.