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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
