A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning (Q2261029): 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/s11336-004-1218-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066261972 / rank | |||
Normal rank | |||
Revision as of 21:43, 19 March 2024
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
