_:N0a8e7fa0408e414e8d9adac85a7c9378 .
.
_:N0a8e7fa0408e414e8d9adac85a7c9378 "doi" .
.
.
_:N10bb005bc1314a14bf5af51ebf24a5ed "LANCE" .
.
"218-218" .
"1476-4687" .
.
"Information Systems" .
"2019-04-11T11:51" .
_:Nc09095ca336843519180b2e337136c6f .
_:Nb4a2c91638984c7b9e6b9a27cec23fc3 "readcube_id" .
_:N1bc22f4df9584e98b85f9d816e463b5e "212" .
"https://www.nature.com/articles/212218a0" .
.
.
.
_:N6c1ac0bc635e4409a22fc406d84481bf "pub.1027187332" .
"0090-0028" .
.
.
.
.
.
"1966-10" .
"1966-10-01" .
_:N6c1ac0bc635e4409a22fc406d84481bf .
"https://scigraph.springernature.com/explorer/license/" .
_:N6b5e70ae3aab4ae2a5684a9cfa60c9c2 .
.
.
_:N6c1ac0bc635e4409a22fc406d84481bf .
"Information and Computing Sciences" .
_:Nb4a2c91638984c7b9e6b9a27cec23fc3 "818253507752dcc77eae70e9c458e2890938cc50915ad7aac4f7347db108c7e5" .
_:N0a8e7fa0408e414e8d9adac85a7c9378 .
_:N6d52c6ab192b45b3893c7cadf273e5a2 "5058" .
_:N5d5933ad59cc481fac26309efe366b55 .
.
_:Nc09095ca336843519180b2e337136c6f .
_:N0a8e7fa0408e414e8d9adac85a7c9378 "10.1038/212218a0" .
"A Generalized Sorting Strategy for Computer Classifications" .
_:N1bc22f4df9584e98b85f9d816e463b5e .
.
_:Nb1857bbb1dd34532b51ec3245367254c "WILLIAMS" .
_:N5d5933ad59cc481fac26309efe366b55 _:N6b5e70ae3aab4ae2a5684a9cfa60c9c2 .
_:N6b5e70ae3aab4ae2a5684a9cfa60c9c2 _:Nb1857bbb1dd34532b51ec3245367254c .
_:N10bb005bc1314a14bf5af51ebf24a5ed "G. N." .
_:N10bb005bc1314a14bf5af51ebf24a5ed .
_:Nb4a2c91638984c7b9e6b9a27cec23fc3 .
_:Nb1857bbb1dd34532b51ec3245367254c .
_:Nb4a2c91638984c7b9e6b9a27cec23fc3 .
"non_research_article" .
"false"^^ .
.
_:N5d5933ad59cc481fac26309efe366b55 _:N10bb005bc1314a14bf5af51ebf24a5ed .
_:N6d52c6ab192b45b3893c7cadf273e5a2 .
_:N6d52c6ab192b45b3893c7cadf273e5a2 .
_:Nc09095ca336843519180b2e337136c6f "Springer Nature - SN SciGraph project" .
"articles" .
_:N6c1ac0bc635e4409a22fc406d84481bf "dimensions_id" .
.
"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 median2 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\u20135 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." .
"en" .
_:N1bc22f4df9584e98b85f9d816e463b5e .
.
.
_:Nb1857bbb1dd34532b51ec3245367254c "W. T." .
"Nature" .