Sparse K-Means with the l_q(0leq q< 1) Constraint for High-Dimensional Data Clustering.
Yu WangXiangyu ChangRongjian LiZongben XuPublished in: ICDM (2013)
Keyphrases
- data clustering
- high dimensional
- k means
- clustering algorithm
- low dimensional
- spectral clustering
- cluster analysis
- dimensionality reduction
- unsupervised learning
- high dimensionality
- competitive learning
- deterministic annealing
- data points
- dimension reduction
- clustering quality
- high dimensional data
- exploratory data analysis
- unsupervised feature selection
- gene expression data
- nearest neighbor
- rough k means
- self organizing maps
- feature space
- hierarchical clustering
- subspace clustering
- clustering analysis
- clustering method
- semi supervised clustering
- expectation maximization
- fuzzy c means
- sparse representation
- pairwise constraints
- unsupervised clustering
- high dimensional datasets
- data mining techniques
- object recognition