Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete.
Mirko KrivánekJaroslav MorávekPublished in: FCT (1985)
Keyphrases
- np complete
- convex hull
- clustering algorithm
- data points
- hierarchical clustering
- overlapping clusters
- cluster analysis
- data clustering
- clustering scheme
- k means
- clustering approaches
- fuzzy clustering
- document clustering
- clustering framework
- unsupervised clustering
- clustering method
- self organizing maps
- cluster centers
- density based clustering
- disjoint clusters
- randomly generated
- np hard
- graph clustering
- hierarchical clustering algorithm
- arbitrary shape
- density based clustering algorithm
- intra cluster
- fuzzy c means
- completion times
- clustering quality
- subspace clustering
- computational complexity
- spectral clustering
- extreme points
- polynomial time complexity
- feasible solution
- scheduling problem
- feature space