A coordinate descent MM algorithm for fast computation of sparse logistic PCA
From MaRDI portal
Publication:333734
DOI10.1016/J.CSDA.2013.01.001zbMath1348.65031OpenAlexW1966715760MaRDI QIDQ333734
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
principal component analysisbinary datacoordinate descent algorithmMM algorithmpenalized maximum likelihood
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