Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty (Q2933869)
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: Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty |
scientific article; zbMATH DE number 6378010
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty |
scientific article; zbMATH DE number 6378010 |
Statements
8 December 2014
0 references
generalized degrees of freedom
0 references
grouping
0 references
K-means clustering
0 references
Lasso
0 references
penalized regression
0 references
truncated Lasso penalty (TLP)
0 references
0.8084324598312378
0 references
0.7967104911804199
0 references
0.7718417644500732
0 references
0.7709828019142151
0 references
