This paper describes a set of four BASIC computer programs for computing the Rand index of cluster similarity. The routines calculate the unadjusted Rand Index; the separate routines are designed to handle problems of different sizes and alternate methods of data storage. (Author)

Using examples of data from the areas of information retrieval and of multivariate data analysis, six hierarchic clustering algorithms (single link, median, centroid, group average, complete link, Wards's) are examined and evaluated by using three proposed coefficients of hierarchic structure. Nine references are cited. (EJS)

Using constraints with cluster analysis limits the possible number of clusters. This paper deals with clustering problems where grouping is constrained by a symmetric and reflexive relation. Two approaches, along with illustrations, are presented. (Author/JKS)

Discussion of models for information retrieval focuses on an application of linear algebra to text clustering, namely, a metric for measuring cluster quality based on the theory that cluster quality is proportional to the number of terms that are disjoint across the clusters. Explains term-document matrices and clustering algorithms. (Author/LRW)

This description of the technical details required for using the HIER-GRP computer program, which was developed to group or cluster regression equations in an iterative manner so as to minimize the overall loss of predictive efficiency at each iteration, contains a discussion of the basic algorithm, an outline of the essential steps,…