A novel convex clustering method for high-dimensional data using semiproximal ADMM

DOI10.1155/2020/9216351zbMath1459.62108OpenAlexW3087596862MaRDI QIDQ2004149

Yan Li, Lingchen Kong, Huangyue Chen

Publication date: 14 October 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/9216351

Mathematics Subject Classification ID

Nonparametric regression and quantile regression (62G08) Ridge regression; shrinkage estimators (Lasso) (62J07) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Uses Software

• glasso
• boost
• clusterpath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Adaptive Lasso and Its Oracle Properties
• Statistical properties of convex clustering
• A note on adaptive group Lasso
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Convex clustering for binary data
• Hankel Matrix Rank Minimization with Applications to System Identification and Realization
• Advances in K-means Clustering
• A Method for Comparing Two Hierarchical Clusterings
• Sparse Convex Clustering
• Approximate Evaluation Techniques for the Single-Link and Complete-Link Hierarchical Clustering Procedures
• Convex Clustering via l  1 Fusion Penalization
• Quantile Regression for Analyzing Heterogeneity in Ultra-High Dimension
• Recovering Trees with Convex Clustering
• Regularization and Variable Selection Via the Elastic Net
• Model Selection and Estimation in Regression with Grouped Variables