Robustification of the \(k\)-means clustering problem and tailored decomposition methods: when more conservative means more accurate (Q6601549)
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: Robustification of the \(k\)-means clustering problem and tailored decomposition methods: when more conservative means more accurate |
scientific article; zbMATH DE number 7910162
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Robustification of the \(k\)-means clustering problem and tailored decomposition methods: when more conservative means more accurate |
scientific article; zbMATH DE number 7910162 |
Statements
Robustification of the \(k\)-means clustering problem and tailored decomposition methods: when more conservative means more accurate (English)
0 references
10 September 2024
0 references
\(k\)-means clustering
0 references
alternating direction methods
0 references
robust optimization
0 references
strict robustness
0 references
\(\Gamma\)-robustness
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
