1966
DOI: 10.1038/212218a0
|View full text |Cite
|
Sign up to set email alerts
|

A Generalized Sorting Strategy for Computer Classifications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
57
0

Year Published

1973
1973
2018
2018

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 206 publications
(63 citation statements)
references
References 3 publications
0
57
0
Order By: Relevance
“…A cluster analysis, using the classification algorithm (P = -0.3) of Lance & Williams (1966) was also computed on the 3-way tables, composed by Euclidean distance, in order to group the different variables to their respective mode.…”
Section: Year-to-year Variabilitymentioning
confidence: 99%
“…A cluster analysis, using the classification algorithm (P = -0.3) of Lance & Williams (1966) was also computed on the 3-way tables, composed by Euclidean distance, in order to group the different variables to their respective mode.…”
Section: Year-to-year Variabilitymentioning
confidence: 99%
“…In the so-called combinatorial clustering strategies, the new dissimilarities can be computed from the old ones using the Lance-Williams dissimilarity update formula [15], [16]: If A and B are merged into one cluster AB, then the dissimilarity between any other cluster C and the cluster AB is given by:…”
Section: A Linkage Methodsmentioning
confidence: 99%
“…It should be noted that salinity of fresh water and seawater in sampling station was measured using portable apparatus. Of the existing clustering techniques (Lance and William, 1966;Anderson, 1971;Davis, 1973) the Weighted Pair Group (WPG) method (Davis, 1973) was used in this study.…”
Section: Methodsmentioning
confidence: 99%