A coordinate descent MM algorithm for fast computation of sparse logistic PCA (Q333734)
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: A coordinate descent MM algorithm for fast computation of sparse logistic PCA |
scientific article; zbMATH DE number 6645667
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A coordinate descent MM algorithm for fast computation of sparse logistic PCA |
scientific article; zbMATH DE number 6645667 |
Statements
A coordinate descent MM algorithm for fast computation of sparse logistic PCA (English)
0 references
31 October 2016
0 references
binary data
0 references
coordinate descent algorithm
0 references
MM algorithm
0 references
penalized maximum likelihood
0 references
principal component analysis
0 references
0.8520453
0 references
0.8485364
0 references
0.8476453
0 references
0.8472192
0 references
0.8417804
0 references
0.84045756
0 references
0.8404235
0 references
0.8363787
0 references
