Abstract

Abstract This paper deals with methods of "cluster analysis". In particular we attack the problem of exploring the structure of multivariate data in search of "clusters". The approach taken is to use a computer procedure to obtain the "best" partition of n objects into g groups. A number of mathematical criteria for "best" are discussed and related to statistical theory. A procedure for optimizing the criteria is outlined. Some of the criteria are compared with respect to their behavior on actual data. Results of data analysis are presented and discussed.

Keywords

Partition (number theory)Invariant (physics)Cluster (spacecraft)Computer scienceMultivariate statisticsData miningData structureMathematicsMachine learningCombinatorics

Affiliated Institutions

Related Publications

A dendrite method for cluster analysis

Abstract A method for identifying clusters of points in a multidimensional Euclidean space is described and its application to taxonomy considered. It reconciles, in a sense, tw...

1974 Communication in Statistics- Theory a... 6351 citations

Exploratory Projection Pursuit

Abstract A new projection pursuit algorithm for exploring multivariate data is presented that has both statistical and computational advantages over previous methods. A number o...

1987 Journal of the American Statistical A... 787 citations

Publication Info

Year
1967
Type
article
Volume
62
Issue
320
Pages
1159-1178
Citations
570
Access
Closed

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

570
OpenAlex
25
Influential
295
CrossRef

Cite This

Herman Friedman, Jerrold Rubin (1967). On Some Invariant Criteria for Grouping Data. Journal of the American Statistical Association , 62 (320) , 1159-1178. https://doi.org/10.1080/01621459.1967.10500923

Identifiers

DOI
10.1080/01621459.1967.10500923

Data Quality

Data completeness: 77%