scholarly journals Assessing the robustness of cluster solutions obtained from sparse count matrices.

2019 ◽  
Vol 24 (6) ◽  
pp. 675-689 ◽  
Author(s):  
Kathleen M. Gates ◽  
Zachary F. Fisher ◽  
Cara Arizmendi ◽  
Teague R. Henry ◽  
Kelly A. Duffy ◽  
...  
Keyword(s):  
2009 ◽  
Vol 21 (1) ◽  
pp. 83-101 ◽  
Author(s):  
Sara Dolnicar ◽  
Friedrich Leisch
Keyword(s):  

2012 ◽  
Vol 68 (1-2) ◽  
pp. 1-39 ◽  
Author(s):  
Juncheng Wei ◽  
Matthias Winter

2010 ◽  
Vol 30 (2) ◽  
pp. 427-445 ◽  
Author(s):  
Lakshmi Chandrasekaran ◽  
Srisairam Achuthan ◽  
Carmen C. Canavier

1977 ◽  
Vol 45 (3_suppl) ◽  
pp. 1135-1142
Author(s):  
Richard J. Hofmann

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 / Sign up

Export Citation Format

Share Document