Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization

DOI10.1080/10618600.2019.1629943OpenAlexW2952594818WikidataQ100298429 ScholiaQ100298429MaRDI QIDQ3391453

Michael Weylandt, John Nagorski, Genevera I. Allen

Publication date: 28 March 2022

Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)

Full work available at URL: https://europepmc.org/articles/pmc7518335

zbMATH Keywords

optimizationvisualizationclusteringalgorithmic regularizationdendrogramsconvex clustering

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items (2)

clustRviz ⋮ Unnamed Item

Uses Software

• ConvexLAR
• clusterpath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• The solution path of the generalized lasso
• Statistical properties of convex clustering
• Least angle regression. (With discussion)
• Piecewise linear regularized solution paths
• Splitting Methods in Communication, Imaging, Science, and Engineering
• Approximating parameterized convex optimization problems
• A Practical Scheme and Fast Algorithm to Tune the Lasso With Optimality Guarantees
• An ordinary differential equation-based solution path algorithm
• Convex Clustering via l  1 Fusion Penalization
• A Generic Path Algorithm for Regularized Statistical Estimation
• Convex biclustering

This page was built for publication: Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization