scientific article; zbMATH DE number 1182575
From MaRDI portal
Publication:4400645
Recommendations
- Approximating K‐means‐type Clustering via Semidefinite Programming
- scientific article; zbMATH DE number 714540
- 0-1 semidefinite programming for graph-cut clustering: modelling and approximation
- Guaranteed clustering and biclustering via semidefinite programming
- On data clustering: exact and approximate solutions
Cited in
(5)- OPTIMAL REES MATRIX CONSTRUCTIONS FOR ANALYSIS OF DATA
- Coordinated decentralized sliding mode MRAC with control cost optimization for a class of nonlinear systems
- 0-1 semidefinite programming for graph-cut clustering: modelling and approximation
- scientific article; zbMATH DE number 714540 (Why is no real title available?)
- Approximating K‐means‐type Clustering via Semidefinite Programming
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 Q4400645)