Pages that link to "Item:Q1950809"
From MaRDI portal
The following pages link to Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency (Q1950809):
Displaying 17 items.
- Sparse optimal discriminant clustering (Q294233) (← links)
- Selection of the number of clusters via the bootstrap method (Q425631) (← links)
- Solution path clustering with adaptive concave penalty (Q457964) (← links)
- Finite mixture regression: a sparse variable selection by model selection for clustering (Q902208) (← links)
- A simple approach to sparse clustering (Q1658539) (← links)
- Variable selection methods for model-based clustering (Q1749770) (← links)
- A dual reformulation and solution framework for regularized convex clustering problems (Q2029898) (← links)
- Grouped spatial autoregressive model (Q2101387) (← links)
- Bayesian inference of clustering and multiple Gaussian graphical models selection (Q2151591) (← links)
- On approximation algorithm for orthogonal low-rank tensor approximation (Q2159448) (← links)
- On uniform concentration bounds for bi-clustering by using the Vapnik-Chervonenkis theory (Q2244449) (← links)
- Full scale multi-output Gaussian process emulator with nonseparable auto-covariance functions (Q2374734) (← links)
- Variable selection in model-based clustering and discriminant analysis with a regularization approach (Q2418093) (← links)
- Strong Consistency of Reduced<i>K</i>-means Clustering (Q2932766) (← links)
- Sparse Convex Clustering (Q3391120) (← links)
- Data Exploration by Representative Region Selection: Axioms and Convergence (Q4958552) (← links)
- Detecting communities in attributed networks through bi-direction penalized clustering and its application (Q6179999) (← links)
