A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning (Q2261029)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning |
scientific article |
Statements
A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning (English)
0 references
6 March 2015
0 references
combinatorial data analysis
0 references
cluster analysis
0 references
\(K\)-means
0 references
branch and bound
0 references
0 references
0 references
0 references
