Mechanism and a new algorithm for nonconvex clustering
From MaRDI portal
Recommendations
- K-means clustering via a nonconvex optimization approach
- scientific article; zbMATH DE number 1897898
- Non-convex clustering via proximal alternating linearized minimization method
- A new non-iterative approach for clustering
- scientific article; zbMATH DE number 7370526
- A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis
Cites work
- A clustering algorithm based on graph connectivity
- A Look at Some Data on the Old Faithful Geyser
- A new algorithm and theory for penalized regression-based clustering
- A nonconvex model with minimax concave penalty for image restoration
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- scientific article; zbMATH DE number 3429948 (Why is no real title available?)
- Likelihood-based selection and sharp parameter estimation
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- Nearest-Neighbor Clutter Removal for Estimating Features in Spatial Point Processes
- Nearly unbiased variable selection under minimax concave penalty
- Solution path clustering with adaptive concave penalty
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: Mechanism and a new algorithm for nonconvex clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5107735)
