A versatile clustering algorithm with objective function and objective measure

Citations of this article
Mendeley users who have this article in their library.
Get full text


A computer program for nonparametric cluster synthesis, using similarity rather than maximum likelihood as the basis for class membership, is presented. The algorithm utilizes recursive computations to develop a hierarchy or tree of nested clusters. The major components of the program are: (1) a (dis)similarity function. (2) a grouping or merger strategy, based on optimizing a dynamic objective function, and (3) a halting criterion, based on evaluating a dynamic objective measure. Program options permit variations of data normalization, measures of similarity, and clustering strategy. A variety of hard-copy summaries and displays are available to the user. An illustrative application to the classification of human mitotic chromosomes is included. © 1972.




Prewitt, J. M. S. (1972). A versatile clustering algorithm with objective function and objective measure. Computer Programs in Biomedicine, 2(4), 297–314. https://doi.org/10.1016/0010-468X(72)90018-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free