Nonmetric Multidimensional Scaling

1. Nonmetric Multidimensional Scaling • input data are ranks: most similar pair AB<CB<AC most different pair, or input data are rating scales: (very similar 1. . .9 very different), but we don't believe in assuming interval level property of data. • This is actually astounding!! We begin with rank/ordinal-level data and result of model is a set of distances or coordinates (both ratio-level).

2. Nonmetric Multidimensional Scaling ^ ^ ^ ^ Some basics • We will be attempting to estimate coordinates Xik's that result in model-fitted distances to match our dissimilarity data as best as possible. • for metric mdsdij = linear function (δij) • for nonmetricdij = monotonic function (δij) • monotonically increasing function (always increases or stays same, never goes down): actually -- 2 definitions of monotonicity i. strong monotonicity: whenever δij < δkl then dij < dkl ii. weak monoticity: whenever δij < δkl then dijdkl We'll go with "b" (less restrictive, less demanding assumptions on data that could be errorful).

3. Nonmetric Multidimensional Scaling ^ ^ ^ ^ b. input dissimilarities data {δij's} are immediately translated to ranks (thus input data can certainly be ranks). example: --- ranked like: --- .20 --- 1 --- .53 .41 --- 3 2 --- c. How to handle "ties" in the data (δij = δkl ranks?) example: --- ranked like: --- .20 --- 1 --- .41 .41 --- 2?3? 2?3? --- i. primary approach to ties: if δij = δkl then dij may or may not equal dkl ii. secondary approach to ties: if δij = δkl then dijdkl We'll go with i because again it's more flexible and less restrictive for data we know are likely errorful.

4. Nonmetric Multidimensional Scaling ^ ^ 3. Monotonic (or "isotonic") regression 3 values to watch for each pair of points (i & j): * data point = dissimilarity = δij, immediately translated to ranks.   * distances = dij computed at each iteration from model (estimate coordinates, compute dij's, etc.)   * disparities = dij (in k & w notation) values needed in the monotonic regression These are close to dij values, but dij's are not distances (i.e., they will not neccessarily satisfy axioms like triangle inequality).

5. Nonmetric Multidimensional Scaling 4. An example of what's done in monotonic regression a. Begin with data b. Translate to ranks: c. We'll have dij's at each iteration (those are computed using formula for Euclidean distance based on estimated coordinates Xik's at that iteration). (The Xik's are estimated via algorithm of "steepest descent").

6. Nonmetric Multidimensional Scaling ^ Rank of δij • Estimate disparities dij's These are distances (so they satisfy our distance axioms), but we want a model to obtain values that are monotonically increasing for our dissimilarities. Note there are deviations (i.e., decreases) at points denoted by "*". dij's = 0

7. Nonmetric Multidimensional Scaling ^ dij Rank δij Shepard Diagram Model Assessment: Kruskal’s “Stress” badness-of-fit: dij's do not form monotonically increasing function, but disparities dij's do: 3 3 6  4.5 3  4.5 5 5 8 8 10 10 13  11 11  11 9  11 15 15