A Generalized Sorting Strategy for Computer Classifications (original) (raw)

Nature volume 212, page 218 (1966) Cite this article

Abstract

AGGLOMERATIVE hierarchical methods of computer classification all begin by calculating distance-measures between elements. The hierarchy is then generated by subjecting these measures to a sorting-strategy, which depends essentially on the definition of a distance-measure between groups of elements. In nearest-neighbour sorting, this is defined as the distance between the closest pair of elements, one in each group. Macnaughton-Smith has pointed out that much more intense clustering can be produced by taking the most remote pair of elements (furthest-neighbour sorting). In group-average sorting1 the distance is defined as the mean of all between-group inter-element distances; in centroid sorting it is the distance between group centroids, defined by a conventional Euclidean model. In _median_2 sorting the distance of a third group from two which have just fused depends on the previous three inter-group distances in the manner of Apollonius's theorem. Although the earlier of these strategies have received some comparative assessment1,3–5 no attempt seems to have been made to generalize them into a single system. As a result, quite different computer strategies have commonly been used, necessitating a separate computer program for each.

This is a preview of subscription content, access via your institution

Access options

Subscribe to this journal

Receive 52 print issues and online access

$199.00 per year

only $3.83 per issue

Buy this article

USD 39.95

Prices may be subject to local taxes which are calculated during checkout

Additional access options:

Similar content being viewed by others

References

  1. Sokal, R. R., and Michener, C. D., Univ. Kansas Sci. Bull., 38, 1409 (1958).
    Google Scholar
  2. Gower, J. C., Biometrics (in the press).
  3. Sokal, R. R., and Sneath, P. H. A., Principles of Numerical Taxonomy (Freeman, San Francisco and London, 1963).
    MATH Google Scholar
  4. Williams, W. T., and Dale, M. B., Adv. Bot. Res., 2, 35 (1965).
    Article Google Scholar
  5. Williams, W. T., Lambert, J. M., and Lance, G. N., J. Ecol., 54, 427 (1966).
    Article Google Scholar
  6. Lance, G. N., and Williams, W. T., Comp. J., 9, 60 (1966).
    Article Google Scholar

Download references

Author information

Authors and Affiliations

  1. C.S.I.R.O. Computing Research Section, Canberra, A.C.T., Australia
    G. N. LANCE & W. T. WILLIAMS

Authors

  1. G. N. LANCE
  2. W. T. WILLIAMS

Rights and permissions

About this article

Cite this article

LANCE, G., WILLIAMS, W. A Generalized Sorting Strategy for Computer Classifications.Nature 212, 218 (1966). https://doi.org/10.1038/212218a0

Download citation

This article is cited by