Structured sparse K -means clustering via Laplacian smoothing
We propose a structured sparse K-means clustering algorithm that learns the cluster assignments and feature weights simultaneously. Compared to previous approaches, including K-means in MacQueen [28] and sparse K-means in Witten and Tibshirani [46], our method exploits the correlation information am...
Main Authors: | Gong, W, Zhao, R, Grünewald, S |
---|---|
Format: | Journal article |
Published: |
Elsevier
2018
|
Similar Items
-
Hyperspectral image spectral-spatial classification via weighted Laplacian smoothing constraint-based sparse representation.
by: Eryang Chen, et al.
Published: (2021-01-01) -
Subarray partition based on sparse array weighted K‐means clustering
by: Jiayu Zhao, et al.
Published: (2024-09-01) -
Combining Max pooling-Laplacian theory and k-means clustering for novel camouflage pattern design
by: Minhao Wan, et al.
Published: (2022-11-01) -
Dictionary training for sparse representation as generalization of K-means clustering
by: Sahoo, Sujit Kumar, et al.
Published: (2013) -
METHOD FUZZY CLUSTERING k-MEANS WITH SMOOTHING PENALTY FUNCTION
by: B. A. Zalesky
Published: (2016-10-01)