Expected-time complexity results for hierarchic clustering algorithms which use cluster centres (Q1838036)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Expected-time complexity results for hierarchic clustering algorithms which use cluster centres |
scientific article; zbMATH DE number 3802806
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Expected-time complexity results for hierarchic clustering algorithms which use cluster centres |
scientific article; zbMATH DE number 3802806 |
Statements
Expected-time complexity results for hierarchic clustering algorithms which use cluster centres (English)
0 references
1983
0 references
probabilistic algorithms
0 references
dynamic searching
0 references
nearest neighbours
0 references
