Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal (Q998835)
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: Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal |
scientific article; zbMATH DE number 5500590
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal |
scientific article; zbMATH DE number 5500590 |
Statements
Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal (English)
0 references
30 January 2009
0 references
\(K\)-means cluster analysis
0 references
dynamic programming
0 references
quadratic assignment
0 references
constrained optimization
0 references
multicriterion optimization
0 references
0 references
0 references
0 references
0.90831804
0 references
0.8969802
0 references
0 references
0.8737487
0 references
0.8686131
0 references
0.8666831
0 references
0.8666831
0 references
