Simplicity Functions for Rotations
To rotate a factor pattern is to apply a non-singular linear transformation
to the unrotated factor pattern matrix. To arrive at an optimal transformation
you must define a so-called simplicity function for assessing the
optimal point. For the promax or the Procrustean transformation,
the simplicity function is defined as the sum of squared differences
between the rotated factor pattern and the target matrix. Thus, the solution of
the optimal transformation is easily obtained by the familiar least-squares
method.
For the class of the generalized Crawford-Ferguson family (Jennrich 1973), the simplicity
function being optimized is
-
f=k1Z+k2H+k3V+k4Q
where


k1, k2, k3, and k4 are constants, and bij represents an element
of the rotated pattern matrix. Except for specialized research purposes, it is rare
in practice to use this simplicity function for rotation. However, it
reduces to many well-known classes and special cases of rotations. One of these is
the Crawford-Ferguson family (Crawford and Ferguson 1970), which minimizes
-
fcf=c1(H-Q)+c2(V-Q)
where c1 and c2 are constants and (H-Q) represents variable (row) parsimony
and (V-Q) represents factor (column) parsimony. Therefore, the relative importance
of the variable and the factor parsimony is adjusted via the constants c1 and c2.
The orthomax class (Carroll, see Harman 1976) maximizes the function

where
is the orthomax weight and is usually between 0 and
the number of variables p. The oblimin class minimizes the function

where
is the oblimin weight and is usually between 0 and
the number of variables p.
All the above definitions are for rotations without row normalization.
For rotations with Kaiser normalization the definition of bij
is replaced by bij/hi, where hi is the communality
of variable i.
Copyright © 2000 by SAS Institute Inc., Cary, NC, USA. All rights reserved.