286 CHAPTER 23
coefficients between pairs of cases. This is done over and over until no improve-
ment can be found. As multidimensional scaling was developed, it was not unusual
to get different results from different programs, but the algorithms for this iterative
procedure are now honed enough that all the programs currently in use are pretty
much equivalent. Some, but not all, large statpacks will perform multidimensional
scaling.
It is easy to visualize multidimensional scaling in two dimensions, and even
in three, but multidimensional scaling solutions can have more dimensions than
physical space does. A perfect rank order correlation between similarity scores and
distances between pairs of points can always be achieved in one less dimension than
the number of variables. For the Ixcaquixtla household unit dataset, for example,
which has ten variables, a configuration of points representing a perfect rank order
correlation between similarity scores and distances between pairs of points can be
achieved in nine dimensions. Since multidimensional scaling results are interpreted
by looking at the configuration, however, this is an unsatisfactory solution. Looking
at a configuration of points in nine dimensions is unbearably cumbersome – more
difficult than simply looking at the original data table to hunt for patterns. The game,
then, is to produce as good a rank order correspondence between similarity scores
and distances between point pairs as possible in as few dimensions as possible. The
smaller the number of dimensions, the easier it is to look at and interpret a multidi-
mensional scaling configuration, so it is a great advantage to produce a configuration
that represents the patterns in the similarity scores, not perfectly, but very accurately
in very few dimensions. For any dataset, the larger the number of dimensions, the
stronger the rank order correlation will be between distances between pairs of points
and similarity scores between pairs of cases.
CONFIGURATIONS IN DIFFERENT NUMBERS
OF DIMENSIONS
Carrying out multidimensional scaling starts by asking a statpack to take a set
of similarity scores between cases (as described in Chapter 22) and produce the
best possible configuration in one dimension. A one-dimensional configuration, of
course, is an arrangement of points representing the cases along a line. Multidimen-
sional scaling can be based on any one of several different rank order correlations,
which are commonly referred to in this context as stress values. The different stress
coefficients generally do not produce very different results. The lower the stress
value, the better the rank order correlation between similarity scores and distances
between pairs of points. For the matrix of similarity scores between Ixcaquixtla
household units from Table
22.9, a one-dimensional configuration can be produced
that has a final stress value of 0.3706. It is called a “final” stress value because
the procedure is iterative, and a stress value is calculated at each step in the pro-
cess. The iteration history of this scaling began with an initial configuration with
a stress value of 0.4452. After the first successful iteration, which improved the