Pages that link to "Item:Q4571208"

The following pages link to Sparse $k$-Means with $\ell_{\infty}/\ell_0$ Penalty for High-Dimensional Data Clustering (Q4571208):

Displaying 9 items.

• Data filtering for cluster analysis by \(\ell _0\)-norm regularization (Q1686543) (← links)
• Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency (Q1950809) (← links)
• A novel convex clustering method for high-dimensional data using semiproximal ADMM (Q2004149) (← links)
• Sparse probabilistic K-means (Q2185434) (← links)
• (Q4998948) (← links)
• K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance (Q5419132) (← links)
• The provably good parallel seeding algorithms for the <i>k</i>‐means problem with penalties (Q6092504) (← links)
• An approximation algorithm based on seeding algorithm for fuzzy \(k\)-means problem with penalties (Q6566781) (← links)
• Adaptive sufficient sparse clustering by controlling false discovery (Q6643229) (← links)