Name
Abstract | ||
|---|---|---|
•We show that k-means clustering under balance constraints is NP-hard for triplets.•We answer an open question about from which cardinality the problem was NP-hard.•The paper adds an important complexity result to the clustering literature. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.patrec.2017.05.033 | Pattern Recognition Letters |
Keywords | Field | DocType |
Balanced clustering,Sum-of-squares,Complexity | k-medians clustering,Discrete mathematics,CURE data clustering algorithm,Combinatorics,Complete-linkage clustering,Correlation clustering,Determining the number of clusters in a data set,FLAME clustering,Cluster analysis,Mathematics,Single-linkage clustering | Journal |
Volume | Issue | ISSN |
97 | C | 0167-8655 |
Citations | PageRank | References |
2 | 0.40 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Artem V. Pyatkin | 1 | 137 | 12.51 |
| Daniel Aloise | 2 | 344 | 24.21 |
| Nenad Mladenovic | 3 | 1882 | 127.14 |