Regularized k-means clustering of high-dimensional data and its asymptotic consistency
From MaRDI portal
Publication:1950809
Recommendations
- Robust and sparse \(k\)-means clustering for high-dimensional data
- A PROBABILISTIC ℓ1 METHOD FOR CLUSTERING HIGH-DIMENSIONAL DATA
- Sparse $k$-Means with $\ell_{\infty}/\ell_0$ Penalty for High-Dimensional Data Clustering
- Probabilistic clustering of high dimensional norms
- Consistency of regularized spectral clustering
- Improving the accuracy and internal consistency of regression-based clustering of high-dimensional datasets
- scientific article; zbMATH DE number 954488
- Strong consistency of reduced \(K\)-means clustering
- Randomized Dimensionality Reduction for <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Means Clustering
- High-dimensional clustering via random projections
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 845634 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- A new approach: interrelated two-way clustering of gene expression data
- A note on adaptive group Lasso
- Better Subset Regression Using the Nonnegative Garrote
- Comparison of Discrimination Methods for the Classification of Tumors Using Gene Expression Data
- Consistent selection of the number of clusters via crossvalidation
- Correlation clustering
- Estimating the number of clusters in a data set via the gap statistic
- Geometric Representation of High Dimension, Low Sample Size Data
- Higher criticism thresholding: Optimal feature selection when useful features are rare and weak
- Least squares quantization in PCM
- Model Selection and Estimation in Regression with Grouped Variables
- Nonconcave penalized likelihood with a diverging number of parameters.
- On the adaptive elastic net with a diverging number of parameters
- Pairwise Variable Selection for High-Dimensional Model-Based Clustering
- Penalized cluster analysis with applications to family data
- Penalized model-based clustering with application to variable selection
- Strong consistency of k-means clustering
- The Adaptive Lasso and Its Oracle Properties
- Tikhonov Regularization for Finitely and Infinitely Smoothing Operators
- Variable Selection for Model-Based Clustering
- Variable Selection for Model-Based High-Dimensional Clustering and Its Application to Microarray Data
- Variable Selection in Penalized Model‐Based Clustering Via Regularization on Grouped Parameters
Cited in
(33)- Sparse Convex Clustering
- Dynamic Peer Groups of Arbitrage Characteristics
- Robust and sparse \(k\)-means clustering for high-dimensional data
- On the Use of Minimum Penalties in Statistical Learning
- A novel convex clustering method for high-dimensional data using semiproximal ADMM
- Simultaneous Clustering and Estimation of Heterogeneous Graphical Models
- Full scale multi-output Gaussian process emulator with nonseparable auto-covariance functions
- Strong consistency of reduced \(K\)-means clustering
- Bayesian inference of clustering and multiple Gaussian graphical models selection
- Detecting clusters in multivariate response regression
- A dual reformulation and solution framework for regularized convex clustering problems
- Dynamic tensor clustering
- Consistency of archetypal analysis
- Quantile-based clustering
- On uniform concentration bounds for bi-clustering by using the Vapnik-Chervonenkis theory
- Variable selection methods for model-based clustering
- Detecting communities in attributed networks through bi-direction penalized clustering and its application
- Joint Gaussian graphical model estimation: a survey
- On approximation algorithm for orthogonal low-rank tensor approximation
- Sparse $k$-Means with $\ell_{\infty}/\ell_0$ Penalty for High-Dimensional Data Clustering
- On the uniform concentration bounds and large sample properties of clustering with Bregman divergences
- A simple approach to sparse clustering
- Grouped spatial autoregressive model
- Clustering High-Dimensional Data via Feature Selection
- scientific article; zbMATH DE number 7370572 (Why is no real title available?)
- Simultaneous estimation of cluster number and feature sparsity in high‐dimensional cluster analysis
- Data exploration by representative region selection: axioms and convergence
- Selection of the number of clusters via the bootstrap method
- Improving the accuracy and internal consistency of regression-based clustering of high-dimensional datasets
- Variable selection in model-based clustering and discriminant analysis with a regularization approach
- Finite mixture regression: a sparse variable selection by model selection for clustering
- Solution path clustering with adaptive concave penalty
- Sparse optimal discriminant clustering
This page was built for publication: Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1950809)
