On the complexity of clustering with relaxed size constraints in fixed dimension.
Massimiliano GoldwurmJianyi LinFrancesco SaccàPublished in: Theor. Comput. Sci. (2018)
Keyphrases
- space complexity
- computational complexity
- fixed parameter tractable
- memory requirements
- clustering algorithm
- data clustering
- semi supervised clustering
- fixed size
- k means
- clustering method
- constrained clustering
- spectral clustering
- instance level constraints
- unsupervised clustering
- approximation error
- global constraints
- cluster analysis
- unsupervised learning
- worst case
- constraint programming
- hierarchical clustering
- data sets
- decision problems
- categorical data
- network size
- exponential size
- vapnik chervonenkis dimension
- similarity function
- maintenance cost
- fixed number
- geometric constraints
- anomaly detection
- np complete
- data points
- search engine
- neural network