No label defined (Q3707149)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3936255
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3936255 |
Statements
1985
0 references
ultrametric
0 references
scatter function
0 references
algorithms
0 references
hierarchical classifications
0 references
CLAS.F.1
0 references
S.C.Johnson's algorithm
0 references
CLAS.F.2
0 references
0.8479440212249756
0 references
Let \(X=\{x^ 1,...,x^ n\}\) be a set of elements to be classified. As has been shown by the author, ibid. 19, No.4, 55-60 (1984; Zbl 0564.62050), the rigorous construction of a total hierarchical classification requires an ultrametric distance on X, or, equivalently, a scatter function. By fundamental algorithms for hierarchical classification we present methods for the construction of hierarchical classifications based on one of these two elements. The algorithm CLAS.F.1, based on an ultrametric distance is, in fact, \textit{S. C. Johnson}'s algorithm [Psychometrika 32, 241--254 (1967; Zbl 1367.62191)] somewhat modified in order to eliminate the existing ambiguities of the original version and to assure the uniqueness of the construction. The algorithm CLAS.F.2 requires the scatter function and it is shown that the hierarchy constructed by this algorithm, corresponding to a scatter function \(\gamma\), is the same as the hierarchy constructed by CLAS.F.1, if an ultrametric compatible with \(\gamma\) is used.
0 references