On the complexity of clustering with relaxed size constraints in fixed dimension (Q1704856)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6849499
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of clustering with relaxed size constraints in fixed dimension |
scientific article; zbMATH DE number 6849499 |
Statements
On the complexity of clustering with relaxed size constraints in fixed dimension (English)
0 references
13 March 2018
0 references
geometric clustering problems
0 references
cluster-size constraints
0 references
computational complexity
0 references
constrained \(k\)-means
0 references
0 references
0.9766747951507568
0 references
0.893336296081543
0 references
0.8483685851097107
0 references
0.8312734365463257
0 references
0.7909861207008362
0 references
