Approximating K‐means‐type Clustering via Semidefinite Programming (Q5444287): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Q181216 / rank | |||
| Property / author | |||
| Property / author: Jiming Peng / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Bow / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/050641983 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1986219860 / rank | |||
Normal rank | |||
Latest revision as of 02:38, 20 March 2024
scientific article; zbMATH DE number 5240429
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating K‐means‐type Clustering via Semidefinite Programming |
scientific article; zbMATH DE number 5240429 |
Statements
Approximating K‐means‐type Clustering via Semidefinite Programming (English)
0 references
25 February 2008
0 references
principal component analysis
0 references
0-1 SDP
0 references
relaxation
0 references
computational complexity
0 references
