Nonmetric Grouping: Clusters and Cliques
Open Access
- 1 September 1975
- journal article
- Published by Cambridge University Press (CUP) in Psychometrika
- Vol. 40 (3) , 297-313
- https://doi.org/10.1007/bf02291760
Abstract
A class of related nonmetric (“monotone invariant”) hierarchical grouping methods is presented. The methods are defined in terms of generalized cliques, based on a systematically varying specification of the degree of indirectness of permitted relationships (i.e., degree of “chaining”). This approach to grouping is shown to provide a useful framework for grouping methods based on an a priori specification of the properties of the desired subsets, and includes a natural generalization for “complete linkage” and “single linkage” clustering, such as the methods of Johnson [1967]. The central feature of the class of methods is a simple iterative matrix operation on the original disparities (“inverse-proximities” or “dissimilarities”) matrix, and one of the methods also constitutes a very efficient single linkage clustering procedure.Keywords
This publication has 13 references indexed in Scilit:
- Some Applications of Graph Theory to ClusteringPsychometrika, 1974
- A graph‐theoretic definition of a sociometric clique†The Journal of Mathematical Sociology, 1973
- Monotone Invariant Clustering ProceduresPsychometrika, 1973
- Min and Max Hierarchical Clustering using Asymmetric Similarity MeasuresPsychometrika, 1973
- Computer program abstractsBehavioral Science, 1972
- Some Extensions of Johnson's Hierarchical Clustering AlgorithmsPsychometrika, 1972
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Hierarchical clustering schemesPsychometrika, 1967
- On Some Clustering TechniquesIBM Journal of Research and Development, 1964
- Connectivity and Generalized Cliques in Sociometric Group StructurePsychometrika, 1950