A Generalized Sorting Strategy for Computer Classifications

@article{Lance1966AGS,
  title={A Generalized Sorting Strategy for Computer Classifications},
  author={G. N. Lance and W. T. Williams},
  journal={Nature},
  year={1966},
  volume={212},
  pages={218-218}
}
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… CONTINUE READING
Highly Cited
This paper has 92 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 42 citations

92 Citations

01020'67'83'00'17
Citations per Year
Semantic Scholar estimates that this publication has 92 citations based on the available data.

See our FAQ for additional information.