Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Direct Clustering of a Data Matrix

J. A. Hartigan
Journal of the American Statistical Association
Vol. 67, No. 337 (Mar., 1972), pp. 123-129
DOI: 10.2307/2284710
Stable URL: http://www.jstor.org/stable/2284710
Page Count: 7
  • Download ($14.00)
  • Cite this Item
Direct Clustering of a Data Matrix
Preview not available

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.

Page Thumbnails

  • Thumbnail: Page 
123
    123
  • Thumbnail: Page 
124
    124
  • Thumbnail: Page 
125
    125
  • Thumbnail: Page 
126
    126
  • Thumbnail: Page 
127
    127
  • Thumbnail: Page 
128
    128
  • Thumbnail: Page 
129
    129