A Generalized Sorting Strategy for Computer Classifications

@article{Lance1966AGS,
  title={A Generalized Sorting Strategy for Computer Classifications},
  author={G. Lance and W. Williams},
  journal={Nature},
  year={1966},
  volume={212},
  pages={218-218}
}
  • G. Lance, W. Williams
  • Published 1966
  • Computer Science
  • Nature
  • 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
    211 Citations

    Topics from this paper.

    Solving Non-Uniqueness in Agglomerative Hierarchical Clustering Using Multidendrograms
    • 129
    • PDF
    New combinatorial clustering methods
    • 14
    • PDF
    New combinatorial clustering methods
    • 24
    MultiDendrograms: variable-group agglomerative hierarchical clusterings
    A method of predicting the number of clusters using Rand's statistic
    • 14
    Fuzzy Clustering: A Historical Perspective
    • 13