Biconvex Clustering
From MaRDI portal
Publication:6141174
DOI10.1080/10618600.2023.2197474arXiv2008.01760OpenAlexW4362472879MaRDI QIDQ6141174
Jason Xu, Saptarshi Chakraborty
Publication date: 22 January 2024
Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.01760
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Adaptive Lasso and Its Oracle Properties
- A survey on feature weighting based K-means algorithms
- Selection of the number of clusters via the bootstrap method
- Statistical properties of convex clustering
- Synthesized clustering: A method for amalgamating alternative clustering bases with differential weighting of variables
- Feature weighting in \(k\)-means clustering
- The smooth-Lasso and other \(\ell _{1}+\ell _{2}\)-penalized methods
- Hierarchical clustering with optimal transport
- Uniform Hanson-Wright type concentration inequalities for unbounded entries via the entropy method
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- Sparse Convex Clustering
- Just relax: convex programming methods for identifying sparse signals in noise
- Convex Clustering via l 1 Fusion Penalization
- Clustering Objects on Subsets of Attributes (with Discussion)
- Sparsity and Smoothness Via the Fused Lasso
- Least squares quantization in PCM
- Recovering Trees with Convex Clustering
- Adaptive nonparametric regression with the K-nearest neighbour fused lasso
- Dynamic Tensor Clustering
- Convex clustering analysis for histogram‐valued data
- A Framework for Feature Selection in Clustering
- Convex biclustering
- The effectiveness of lloyd-type methods for the k-means problem
- Model Selection and Estimation in Regression with Grouped Variables
- A Bound on Tail Probabilities for Quadratic Forms in Independent Random Variables
- Convergence of a block coordinate descent method for nondifferentiable minimization
