Solution path clustering with adaptive concave penalty
From MaRDI portal
Publication:457964
DOI10.1214/14-EJS934zbMath1297.62142arXiv1404.6289OpenAlexW3103803535MaRDI QIDQ457964
Publication date: 30 September 2014
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.6289
Ridge regression; shrinkage estimators (Lasso) (62J07) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (5)
Data filtering for cluster analysis by \(\ell _0\)-norm regularization ⋮ Mechanism and a new algorithm for nonconvex clustering ⋮ Clustering of subsample means based on pairwise L1 regularized empirical likelihood ⋮ Unnamed Item ⋮ Recovering Trees with Convex Clustering
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimating the Number of Clusters in a Data Set Via the Gap Statistic
- Nearly unbiased variable selection under minimax concave penalty
- Selection of the number of clusters via the bootstrap method
- God, king, and geometry: revisiting the introduction to Cauchy's \textit{Cours d'analyse}
- Nonparametric clustering of functional data
- A general trimming approach to robust cluster analysis
- A coordinate gradient descent method for nonsmooth separable minimization
- Least angle regression. (With discussion)
- Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency
- Penalized model-based clustering with unconstrained covariance matrices
- Pathwise coordinate optimization
- Coordinate descent algorithms for lasso penalized regression
- Handling missing values in support vector machine classifiers
- Pairwise Variable Selection for High-Dimensional Model-Based Clustering
- SparseNet: Coordinate Descent With Nonconvex Penalties
- 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
- Clustering in the Presence of Scatter
- Nearest-Neighbor Clutter Removal for Estimating Features in Spatial Point Processes
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- Robust Clustering Using Outlier-Sparsity Regularization
- Sparsity and Smoothness Via the Fused Lasso
- Learning Sparse Causal Gaussian Networks With Experimental Intervention: Regularization and Coordinate Descent
- A Framework for Feature Selection in Clustering
- Regularization and Variable Selection Via the Elastic Net
- Model Selection and Estimation in Regression with Grouped Variables
- Tight Clustering: A Resampling‐Based Approach for Identifying Stable and Tight Patterns in Data
This page was built for publication: Solution path clustering with adaptive concave penalty
