Cluster Analysis of Subjects, Hierarchical Methods

2
Brian S. Everitt

Brian S. Everitt

Institute of Psychiatry, London, UK

Search for more papers by this author
First published: 15 July 2005
Citations: 2

Abstract

Hierarchical cluster classification involves partitioning data into a series of groups. The first group consists of n single-member “clusters”, the last consists of a single group with all n individuals. Hierarchical cluster classification could be represented by a diagram known as a dendrogram. Properties and problems of hierarchical clustering techniques are described. The two major types of algorithms that have been used to produce hierarchical classifications are agglomerative and divisive. Careful validation of solutions is a clear requirement in any clustering exercise. An example to illustrate hierarchical methods is presented.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.