scientific article; zbMATH DE number 1182575
From MaRDI portal
Publication:4400645
zbMATH Open0903.90177MaRDI QIDQ4400645FDOQ4400645
Authors: Boris Mirkin 
Publication date: 2 August 1998
Title of this publication is not available (Why is that?)
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
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of mathematical programming (90C90) Combinatorial optimization (90C27)
Cited In (5)
- 0-1 semidefinite programming for graph-cut clustering: modelling and approximation
- OPTIMAL REES MATRIX CONSTRUCTIONS FOR ANALYSIS OF DATA
- Approximating K‐means‐type Clustering via Semidefinite Programming
- Title not available (Why is that?)
- Coordinated decentralized sliding mode MRAC with control cost optimization for a class of nonlinear systems
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)
