Optimal algorithms for complete linkage clustering in \(d\) dimensions (Q1608896): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q4867182 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4945505 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient algorithms for agglomerative hierarchical clustering methods / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An efficient algorithm for a complete link method / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast algorithms for complete linkage clustering / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4721426 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3694703 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0304-3975(01)00239-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091146986 / rank | |||
Normal rank | |||
Latest revision as of 10:11, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal algorithms for complete linkage clustering in \(d\) dimensions |
scientific article |
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
