Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1] (Q2010139)
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: Attainable accuracy guarantee for the k-medians clustering in [0, 1] |
scientific article; zbMATH DE number 7139414
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1] |
scientific article; zbMATH DE number 7139414 |
Statements
Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1] (English)
0 references
3 December 2019
0 references
In an original scientific manner, the authors contribute to the study of the renowned \(k\)-medians clustering problem in [0,1], following the attainable appropriate accuracy and the well known Farkas-Minkowski lemma.
0 references
\(k\)-medians clustering
0 references
attainable accuracy
0 references
Farkas-Minkowski lemma
0 references
zero-sum two-player game
0 references
0 references
0.7126603722572327
0 references
0.710713267326355
0 references
0.7054016590118408
0 references
0.6956936717033386
0 references
0.6947309374809265
0 references
