Dimensionality reduction for binary data through the projection of natural parameters
From MaRDI portal
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.
Recommendations
- Probability-enhanced sufficient dimension reduction for binary classification
- Explicit dimension reduction and its applications
- Dimensionality reduction and topographic mapping of binary tensors
- Methods for Binary Multidimensional Scaling
- Dimensionality reduction
- A nonlinear approach to dimension reduction
- A nonlinear approach to dimension reduction
Cites work
- scientific article; zbMATH DE number 47310 (Why is no real title available?)
- scientific article; zbMATH DE number 3061616 (Why is no real title available?)
- A feasible method for optimization with orthogonality constraints
- Generalized low rank models
- On consistency and sparsity for principal components analysis in high dimensions
- Optimization
- Principal component analysis of binary data by iterated singular value decomposition
- Principal component analysis.
- Probabilistic Principal Component Analysis
- Sparse logistic principal components analysis for binary data
Cited in
(9)- Maximum a posteriori inference of random dot product graphs via conic programming
- Bayesian mean-parameterized nonnegative binary matrix factorization
- Dimension reduction for longitudinal multivariate data by optimizing class separation of projected latent Markov models
- Safety signal detection with control of latent factors
- Percolate: an exponential family JIVE model to design DNA-based predictors of drug response
- Clustering of multivariate binary data with dimension reduction via \(L_{1}\)-regularized likelihood maximization
- Dimensionality reduction and topographic mapping of binary tensors
- Sparse logistic principal components analysis for binary data
- Probability-enhanced sufficient dimension reduction for binary classification
This page was built for publication: Dimensionality reduction for binary data through the projection of natural parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201560)
