scientific article; zbMATH DE number 7307486

MaRDI QIDQ5149255zbMATH OpenFDO

Authors Tao Jiang, Chen Wen Zhai, Stephen A. Vavasis

Publication date 8 February 2021

Full work available at URL https://arxiv.org/abs/1902.07137, https://jmlr.csail.mit.edu/papers/v21/19-218.html

zbMATH Keywords

unsupervised learningmixture of Gaussianssum-of-norms clusteringrecovery guarantees

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Gauss mixture quantization: clustering Gauss mixtures
• Clustering subgaussian mixtures by semidefinite programming
• Optimality of spectral clustering in the Gaussian mixture model
• Cutoff for Exact Recovery of Gaussian Mixture Models
• scientific article; zbMATH DE number 1833439
• Clusterability assessment for Gaussian mixture models
• Efficient Computation of Normalized Maximum Likelihood Codes for Gaussian Mixture Models With Its Applications to Clustering
• Gaussian mixture modeling and model-based clustering under measurement inconsistency
• Rectified Gaussian Scale Mixtures and the Sparse Non-Negative Least Squares Problem

Cites work

• Approximating K‐means‐type Clustering via Semidefinite Programming
• Clustering subgaussian mixtures by semidefinite programming
• Convex clustering via \(l_1\) fusion penalization
• Exact matrix completion via convex optimization
• Julia: a fresh approach to numerical computing
• Probability Inequalities for Sums of Bounded Random Variables
• Statistical properties of convex clustering
• Understanding machine learning. From theory to algorithms
• clusterpath

Cited in

(2)

• Local versions of sum-of-norms clustering
• A dimension reduction technique for large-scale structured sparse optimization problems with application to convex clustering

Describes a project that uses

Uses Software

• clusterpath
• Julia

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5149255)