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: | , , |
|---|---|
| Format: | Journal article |
| Published: |
Elsevier
2018
|