1967
DOI: 10.1093/comjnl/10.3.271
|View full text |Cite
|
Sign up to set email alerts
|

A general theory of classificatory sorting strategies: II. Clustering systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
133
0
7

Year Published

1973
1973
2019
2019

Publication Types

Select...
8
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 268 publications
(140 citation statements)
references
References 0 publications
0
133
0
7
Order By: Relevance
“…The data were subjected to a cluster analysis using the Canberra Dissimilarity Measure of Distance (Sneath & Sokal 1973) and to both the Group Average and Flexible Sorting Strategies (Lance & Williams 1967) with a square root transformation V (x + 0.5). This is similar to the technique used by Ebeling et al (1970) in a study of midwater animals off California.…”
Section: Methodsmentioning
confidence: 99%
“…The data were subjected to a cluster analysis using the Canberra Dissimilarity Measure of Distance (Sneath & Sokal 1973) and to both the Group Average and Flexible Sorting Strategies (Lance & Williams 1967) with a square root transformation V (x + 0.5). This is similar to the technique used by Ebeling et al (1970) in a study of midwater animals off California.…”
Section: Methodsmentioning
confidence: 99%
“…We proved that the set of the cocoons of a graph is a hierarchy and released an associated ultrametrics. Cocoons hierarchies are related to complete-linkage clustering while the MST of a graph can be computed by single-linkage clustering [29,18].…”
Section: Ultrametric Distances and The Region/contour Dualitymentioning
confidence: 99%
“…At the start, for each glacier a cluster is defined and then the most 5 similar clusters are iteratively joint until only one cluster is left. The distances between the clusters are updated in each iteration step by applying the Lance-Wiliams algorithms (Lance and Williams, 1967).…”
Section: Cluster Analysismentioning
confidence: 99%