Sparse $k$-Means with $\ell_{\infty}/\ell_0$ Penalty for High-Dimensional Data Clustering

DOI10.5705/ss.202015.0261zbMath1394.62084arXiv1403.7890OpenAlexW2963971338MaRDI QIDQ4571208

Rongjian Li, Yu Wang, Zong Ben Xu, Xiang Yu Chang

Publication date: 6 July 2018

Published in: Statistica Sinica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.7890

zbMATH Keywords

high-dimensional data clusteringscreening propertysparse \(k\)-means

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to biology and medical sciences; meta analysis (62P10)

Related Items (2)

The provably good parallel seeding algorithms for the k‐means problem with penalties ⋮ Unnamed Item

This page was built for publication: Sparse $k$-Means with $\ell_{\infty}/\ell_0$ Penalty for High-Dimensional Data Clustering