New and efficient DCA based algorithms for minimum sum-of-squares clustering (Q898299)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New and efficient DCA based algorithms for minimum sum-of-squares clustering |
scientific article; zbMATH DE number 6517895
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New and efficient DCA based algorithms for minimum sum-of-squares clustering |
scientific article; zbMATH DE number 6517895 |
Statements
New and efficient DCA based algorithms for minimum sum-of-squares clustering (English)
0 references
8 December 2015
0 references
clustering
0 references
MSSC
0 references
Gaussian kernel
0 references
combinatorial optimization
0 references
nonsmooth nonconvex programming
0 references
DC programming
0 references
DCA
0 references
exact penalty
0 references
0 references
0 references
0 references
0 references
0.9143081
0 references
0.8965263
0 references
0.89213336
0 references
0.88678205
0 references
0.8854209
0 references
0 references
