Optimal algorithms for complete linkage clustering in \(d\) dimensions (Q1608896)
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: Optimal algorithms for complete linkage clustering in d dimensions |
scientific article; zbMATH DE number 1780601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal algorithms for complete linkage clustering in \(d\) dimensions |
scientific article; zbMATH DE number 1780601 |
Statements
Optimal algorithms for complete linkage clustering in \(d\) dimensions (English)
0 references
13 August 2002
0 references
complete linkage clustering
0 references
hierarchical clustering
0 references
multidimensional
0 references
optimal algorithms
0 references
approximation algorithms
0 references
0.9077104330062866
0 references
0.8506068587303162
0 references
0.8502227663993835
0 references
0.8074250817298889
0 references
0.8025385141372681
0 references
