Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

A coordinate descent MM algorithm for fast computation of sparse logistic PCA

From MaRDI portal
Publication:333734
Jump to:navigation, search

DOI10.1016/J.CSDA.2013.01.001zbMath1348.65031OpenAlexW1966715760MaRDI QIDQ333734

Seokho Lee, Jianhua Z. Huang

Publication date: 31 October 2016

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2013.01.001


zbMATH Keywords

principal component analysisbinary datacoordinate descent algorithmMM algorithmpenalized maximum likelihood


Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25)


Related Items (4)

Sparse principal component regression with adaptive loading ⋮ Sparse exponential family principal component analysis ⋮ OLS with multiple high dimensional category variables ⋮ Sparse logistic functional principal component analysis for binary data







This page was built for publication: A coordinate descent MM algorithm for fast computation of sparse logistic PCA

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:333734&oldid=12208311"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 02:33.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki