No label defined (Q3324855)
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 3856225
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3856225 |
Statements
1983
0 references
hierarchical learning
0 references
neighbourhood reducibility
0 references
accelerated algorithm
0 references
hierarchical clustering
0 references
adaptive ultrametrics
0 references
0.8335514068603516
0 references
0.7981426119804382
0 references
0.7600977420806885
0 references
0.7599263191223145
0 references
We say that there is an inversion in a hierarchy if the height of a cluster merged later in the hierarchy is lower than that of clusters merged earlier. We give: 1) Necessary and sufficient conditions on the parameters of the G. C. Lance and W. T. Williams formula (1966), generalized by M. Jambu (1978) which insure the existence or non existence of inversion in a hierarchy; one of those new results generalizes the conditions given by P. Ducimetière (1971), G. Milligan (1979) and V. Batagelj (1981). 2) A necessary and sufficient condition on the same parameters which insures the ''neighbourhood reducibility'' property of M. Bruynooghe (1978) and thus permits the use of an accelerated algorithm for hierarchical clustering. By using those results and taking account of the a priori knowledge of the user we show that it is possible to obtain adaptive ultrametrics. This work arises towards learning hierarchical clustering from examples [see the author and \textit{J. V. Moreau}, Learning hierarchical clustering from examples. (1984)].
0 references