1966
DOI: 10.2307/sysbio/15.2.131
|View full text |Cite
|
Sign up to set email alerts
|

Some Processes of Numerical Taxonomy in Terms of Distance

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0
1

Year Published

1969
1969
2017
2017

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 3 publications
0
3
0
1
Order By: Relevance
“…Two standard methods of numerical taxonomy to build a tree from a distance matrix are average linkage and single linkage (Sokal and Sneath, 1963;Proctor, 1966; * Because of difficulties in determining the number of statistically independent distances, no precise level of significance can be attached to such correlations; they must be considered only as a rnathematical measure of similarity for the particular data involved. 7 4 5 6 2 1 9 8 1 0 3 7 4 3 2 6 1 9810 5 7 .…”
Section: Tree Analysesmentioning
confidence: 99%
“…Two standard methods of numerical taxonomy to build a tree from a distance matrix are average linkage and single linkage (Sokal and Sneath, 1963;Proctor, 1966; * Because of difficulties in determining the number of statistically independent distances, no precise level of significance can be attached to such correlations; they must be considered only as a rnathematical measure of similarity for the particular data involved. 7 4 5 6 2 1 9 8 1 0 3 7 4 3 2 6 1 9810 5 7 .…”
Section: Tree Analysesmentioning
confidence: 99%
“…At present there does not seem to be a generally agreed definition of a cluster which would lead to a single accepted method of clustering. Different methods have been applied to the same data, and the results compared to suggest the deficiencies and relative merit of the methods (Lange, Stenhouse & Offler, 1965;'t Mannetje, 1967); methods have been compared on theoretical grounds (Sokal & Sneath, 1963;Proctor, 1966;Gower, I 967), and by applying them to artificially generated data (Lange et al I 965 ;Sneath, 1966).…”
mentioning
confidence: 99%
“…Equation (4) is the general coefficient of association of Colless (1967), and equation (5) is the simple matching coefficient (see Sokal and Sneath, 1963). SE = VSCB), as pointed out by Procter (1966). SE = VSCB), as pointed out by Procter (1966).…”
Section: Appendix On Similaeittes and Proximitiesmentioning
confidence: 74%