Robust discriminative clustering with sparse regularizers
From MaRDI portal
Recommendations
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A generalized solution of the orthogonal Procrustes problem
- A note on cluster analysis and dynamic programming
- Block coordinate descent methods for semidefinite programming
- Complementary Slackness and Dynamic Programming
- Convex analysis and nonlinear optimization. Theory and examples
- Die projektive Theorie der “ paths” $x^{\left( 3 \right)i} + A_k^i x^{\left( 2 \right)k} + B^i = 0$
- Efficiently learning mixtures of two Gaussians
- Graph implementations for nonsmooth convex programs
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 3717735 (Why is no real title available?)
- scientific article; zbMATH DE number 3779842 (Why is no real title available?)
- scientific article; zbMATH DE number 125386 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Improved approximation algorithms for MAX k-CUT and MAX BISECTION
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- In search of non-Gaussian components of a high-dimensional distribution
- Low-rank optimization on the cone of positive semidefinite matrices
- Manopt, a Matlab toolbox for optimization on manifolds
- Maximum volume clustering: a new discriminative clustering approach
- On Non-Linear Differential Equations of the Second Order: I. the Equation y¨ − k (1-y 2 )y˙ + y = b λk cos(λl + α), k Large
- On the Diophantine equation y(y + 1)(y + 2)(y + 3) = n^2x(x + 1)(x + 2)(x + 3)
- On the singularity probability of discrete random matrices
- Optimization with sparsity-inducing penalties
- Reducibility among combinatorial problems
- Smoothing technique and its applications in semidefinite optimization
- Some simplified NP-complete graph problems
- Sparse non Gaussian component analysis by semidefinite programming
- Statistical Models
- Studies on the difference equation \(x _{ n+1} = 1/(x _{ n }+x _{ n - 2})\)
- The diophantine equations (x^2 - c)^2 = (t^2 ± 2) y^2 + 1
- The effectiveness of Lloyd-type methods for the \(k\)-means problem
- The elliptic curves y^2=x(x-1)(x- ).
- Ultra-contractivity for Keller-Segel model with diffusion exponent \(m>1-2/d\)
- User-friendly tail bounds for sums of random matrices
Cited in
(8)- Robust and sparse multigroup classification by the optimal scoring approach
- Discriminative clustering with representation learning with any ratio of labeled to unlabeled data
- Robust latent regression with discriminative regularization by leveraging auxiliary knowledge
- Maximum volume clustering: a new discriminative clustering approach
- Sparse optimal discriminant clustering
- Robust formulations for clustering-based large-scale classification
- An enhanced approach to the robust discriminant analysis and class sparsity based embedding
- Clustering a mixture of Gaussians with unknown covariance
This page was built for publication: Robust discriminative clustering with sparse regularizers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636989)
