Mechanism and a new algorithm for nonconvex clustering
From MaRDI portal
Publication:5107735
DOI10.1080/00949655.2019.1700986OpenAlexW2997087955WikidataQ126469893 ScholiaQ126469893MaRDI QIDQ5107735
Publication date: 28 April 2020
Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00949655.2019.1700986
Related Items (1)
Uses Software
Cites Work
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Nearly unbiased variable selection under minimax concave penalty
- Solution path clustering with adaptive concave penalty
- A clustering algorithm based on graph connectivity
- A nonconvex model with minimax concave penalty for image restoration
- A Look at Some Data on the Old Faithful Geyser
- 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
- Likelihood-Based Selection and Sharp Parameter Estimation
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Mechanism and a new algorithm for nonconvex clustering