This paper develops a coordinate descent MM algorithm for computation of sparse logistic PCA. The new algorithm is faster than an existing algorithm proposed ...

Lee S, Huang JZ (2013) A coordinate descent MM algorithm for fast computation of sparse logistic PCA. Computational Statistics & Data Analysis 62: 26–38.

Our new algorithm decouples the joint estimation of multiple components into separate estimations and consists of closed-form elementwise updating formulas for ...

Our new algorithm decouples the joint estimation of multiple components into separate estimations and consists of closed-form elementwise updating formulas for ...

Our new algorithm decouples the joint estimation of multiple components into separate estimations and consists of closed-form elementwise updating formulas for ...

Sparse logistic principal component analysis was proposed in Lee et al. (2010) for exploratory analysis of binary data. Relying on the joint estimation of ...

We implement the Sparse Logistic Singular Value Decomposition (SLSVD) using the Majorization-Minimization (MM) and coordinate descent (CD) algorithms in ...

In this paper, we propose a novel algorithm to solve the row-sparse principal component analysis problem without relying on any data structure assumption.

Sep 16, 2021 · Huang. A coordinate descent mm algorithm for fast computation of sparse logistic pca. Computational Statistics & Data Analysis, 62:26–38, 2013.

Dec 11, 2022 · A coordinate descent MM algorithm for fast computation of sparse logistic PCA. Sparse logistic principal component analysis was proposed in Lee ...