A versatile clustering algorithm with objective function and objective measure.
暂无分享,去创建一个
Abstract 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.
[1] G. Spivack,et al. Symptom syndromes of emergency cases in an urban community mental health center. , 1972, Comprehensive psychiatry.
[2] Calyampudi R. Rao,et al. Advanced Statistical Methods in Biometric Research. , 1953 .
[3] L. S. Penrose. A theory of DNA replication , 1960, Annals of human genetics.
[4] G. Spivack,et al. Syndromes of Disturbed Classroom Behavior: A Behavioral Diagnostic System for Elementary Schools , 1971 .