A heuristic algorithm for solving the minimum sum-of-squares clustering problems (Q2018474)
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 heuristic algorithm for solving the minimum sum-of-squares clustering problems |
scientific article; zbMATH DE number 6419081
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic algorithm for solving the minimum sum-of-squares clustering problems |
scientific article; zbMATH DE number 6419081 |
Statements
A heuristic algorithm for solving the minimum sum-of-squares clustering problems (English)
0 references
24 March 2015
0 references
minimum sum-of-squares clustering
0 references
global optimization
0 references
nonsmooth optimization
0 references
\(k\)-means algorithm
0 references
global \(k\)-means algorithm
0 references
0 references
0 references
0 references
0 references
0.8882697224617004
0 references
0.8062334656715393
0 references
0.7967970371246338
0 references
0.7945697903633118
0 references
0.7863389849662781
0 references
