Faster algorithms for the constrained \(k\)-means problem (Q1702850)
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 6845591
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster algorithms for the constrained \(k\)-means problem |
scientific article; zbMATH DE number 6845591 |
Statements
Faster algorithms for the constrained \(k\)-means problem (English)
0 references
1 March 2018
0 references
constrained \(k\)-means clustering
0 references
\(D^2\) sampling
0 references
0 references
0.9978342652320862
0 references
0.8450330495834351
0 references
0.794516921043396
0 references
0.7893812656402588
0 references
