Finding the Optimal Subspace for Clustering.
Sebastian GoeblXiao HeClaudia PlantChristian BöhmPublished in: ICDM (2014)
Keyphrases
- subspace clustering
- high dimensional data
- clustering algorithm
- k means
- finding optimal
- clustering method
- dynamic programming
- data clustering
- high dimensional
- clustering high dimensional data
- optimal design
- hierarchical clustering
- feature space
- low dimensional
- optimal solution
- closed form
- worst case
- optimal control
- data sets
- graph theoretic
- cluster analysis
- document clustering
- principal component analysis
- categorical data
- data points
- np hard