Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1] (Q2010139): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11590-018-1305-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2887156225 / rank | |||
Normal rank | |||
Revision as of 23:17, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1] |
scientific article |
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
