The complexity of detecting fixed-density clusters.
Klaus HolzapfelSven KosubMoritz G. MaaßHanjo TäubigPublished in: Discret. Appl. Math. (2006)
Keyphrases
- worst case
- arbitrary shape
- clustering algorithm
- data points
- complexity analysis
- fuzzy clustering
- hierarchical structure
- density based clustering algorithm
- graph clustering
- decision problems
- website
- data distribution
- computational complexity
- cluster analysis
- data structure
- subspace clustering
- fixed number
- social networks
- neural network
- hierarchical clustering algorithm
- real time