Some Algorithms for the Computation of Independent Cluster Solutions

Abstract

The Harris and Kaiser algorithm for computing independent cluster solutions is discussed and an alternative algorithm is presented. Both algorithms are presented within the context of a general algebraic framework for ideal orthogonal and oblique independent cluster solutions. Finally an example is presented whereby the alternative algorithm defines a better approximation to an ideal independent cluster solution than does Harris and Kaiser's algorithm.