On the Complexity of Clustering with Relaxed Size Constraints.
Massimiliano GoldwurmJianyi LinFrancesco SaccàPublished in: AAIM (2016)
Keyphrases
- space complexity
- computational complexity
- constrained clustering
- k means
- clustering method
- clustering algorithm
- spectral clustering
- instance level constraints
- worst case time complexity
- polynomial size
- outlier detection
- unsupervised learning
- memory requirements
- cluster analysis
- worst case
- data points
- information theoretic
- constraint networks
- space requirements
- linear constraints
- graph theoretic
- data mining tasks
- fuzzy clustering
- distance metric
- computational cost
- data clustering
- document clustering
- constraint programming
- categorical data
- bayesian networks
- complexity analysis
- hierarchical clustering
- semi supervised clustering
- genetic algorithm
- complexity bounds
- self organizing maps
- exponential size