scientific article; zbMATH DE number 5957371
From MaRDI portal
Publication:3093399
Recommendations
- 0-1 semidefinite programming for graph-cut clustering: modelling and approximation
- Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
- Sketching Semidefinite Programs for Faster Clustering
- An efficient semidefinite programming relaxation for the graph partition problem
- Semidefinite programming relaxations for the graph partitioning problem
- scientific article; zbMATH DE number 2196288
- A tight semidefinite relaxation of the MAX CUT problem
- Sublinear algorithms for MAXCUT and correlation clustering
- Copositivity cuts for improving SDP bounds on the clique number
Cited in
(9)- Iterative ensemble normalized cuts
- Using SeDuMi to find various optimal designs for regression models
- Enhanced balanced min cut
- Multi-class transductive learning based on \(\ell^1\) relaxations of Cheeger cut and Mumford-Shah-Potts model
- Semidefinite spectral clustering
- Approximating spectral clustering via sampling: a review
- Clustering is semidefinitely not that hard: nonnegative SDP for manifold disentangling
- An efficient algorithm for maximal margin clustering
- Spectral methods for graph clustering - a survey
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 Q3093399)
