0-1 semidefinite programming for graph-cut clustering: modelling and approximation

MaRDI QIDQ3515782zbMATH OpenFDO

Authors Huarong Chen, Jiming Peng

Publication date 29 July 2008

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Recommendations

• Approximating K‐means‐type Clustering via Semidefinite Programming
• Semidefinite spectral clustering
• scientific article; zbMATH DE number 2088028
• Optimum cut-based clustering
• scientific article; zbMATH DE number 1182575

Cited in

(7)

• Probably certifiably correct k-means clustering
• Semidefinite spectral clustering
• scientific article; zbMATH DE number 5957371 (Why is no real title available?)
• scientific article; zbMATH DE number 1182575 (Why is no real title available?)
• scientific article; zbMATH DE number 1945218 (Why is no real title available?)
• Approximating K‐means‐type Clustering via Semidefinite Programming
• An efficient algorithm for maximal margin clustering

This page was built for publication: 0-1 semidefinite programming for graph-cut clustering: modelling and approximation

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