A \(k\)-median algorithm with running time independent of data size (Q703077)
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: A k-median algorithm with running time independent of data size |
scientific article; zbMATH DE number 2129672
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \(k\)-median algorithm with running time independent of data size |
scientific article; zbMATH DE number 2129672 |
Statements
A \(k\)-median algorithm with running time independent of data size (English)
0 references
19 January 2005
0 references
Clustering
0 references
sampling
0 references
sublinear
0 references
0.8725253939628601
0 references
0.8561012744903564
0 references
0.8501951098442078
0 references
0.8313389420509338
0 references
