Direct Clustering of a Data Matrix
J. A. Hartigan(Yale University)
Cited by 1,083
Abstract
Abstract Clustering algorithms are now in widespread use for sorting heterogeneous data into homogeneous blocks. If the data consist of a number of variables taking values over a number of cases, these algorithms may be used either to construct clusters of variables (using, say, correlation as a measure of distance between variables) or clusters of cases. This article presents a model, and a technique, for clustering cases and variables simultaneously. The principal advantage in this approach is the direct interpretation of the clusters on the data.
Related Papers
No related papers found
Powered by citation graph analysis