Untangling Gaussian mixtures
From MaRDI portal
Cites work
- A cost function for similarity-based hierarchical clustering
- A refinement of the remainder in the Lyapunov theorem
- Abstract separation systems
- Canonical tree-decompositions of finite graphs. I: Existence and algorithms.
- Directed tree-width
- Fourier analysis of distribution functions. A mathematical study of the Laplace-Gaussian law
- Graph minors. X: Obstructions to tree-decomposition
- Hierarchical clustering: objective functions and algorithms
- scientific article; zbMATH DE number 7561535 (Why is no real title available?)
- Hypertree width and related hypergraph invariants
- Introducing directed tree width
- Partial recovery bounds for clustering with the relaxed K-means
- Probability Inequalities for Sums of Bounded Random Variables
- Probability theory. A comprehensive course
- Profiles of separations: in graphs, matroids, and beyond
- Settling the polynomial learnability of mixtures of Gaussians
- Settling the robust learnability of mixtures of Gaussians
- Structural submodularity and tangles in abstract separation systems
- Tangle-tree duality in abstract separation systems
- Tangles and Hierarchical Clustering
- Tangles and single linkage hierarchical clustering
- Tangles, tree-decompositions and grids in matroids
- The accuracy of the Gaussian approximation to the sum of independent variates.
- Trees of tangles in abstract separation systems
- Unifying duality theorems for width parameters in graphs and matroids (extended abstract)
This page was built for publication: Untangling Gaussian mixtures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988719)
