Dimensionality Reduction for Binary Data through the Projection of Natural Parameters

Abstract

Principal component analysis (PCA) for binary data, known as logistic PCA, has become a popular alternative to dimensionality reduction of binary data. It is motivated as an extension of ordinary PCA by means of a matrix factorization, akin to the singular value decomposition, that maximizes the Bernoulli log-likelihood. We propose a new formulation of logistic PCA which extends Pearson's formulation of a low dimensional data representation with minimum error to binary data. Our formulation does not require a matrix factorization, as previous methods do, but instead looks for projections of the natural parameters from the saturated model. Due to this difference, the number of parameters does not grow with the number of observations and the principal component scores on new data can be computed with simple matrix multiplication. We derive explicit solutions for data matrices of special structure and provide computationally efficient algorithms for solving for the principal component loadings. Through simulation experiments and an analysis of medical diagnoses data, we compare our formulation of logistic PCA to the previous formulation as well as ordinary PCA to demonstrate its benefits.

References in corpus (1)

• Sparse logistic principal components analysis for binary data

Cited by in corpus (7)

• A majorization-minimization algorithm for nonnegative binary matrix factorization
• Efficient Bayesian Modeling of Binary and Categorical Data in R: The UPG Package
• An Overview on the Landscape of R Packages for Credit Scoring
• A lower bound for the ELBO of the Bernoulli Variational Autoencoder
• Sparse Logistic Tensor Decomposition for Binary Data
• Maximum a Posteriori Inference of Random Dot Product Graphs via Conic Programming
• Visualizing and Understanding Large-Scale Assessments in Mathematics through Dimensionality Reduction