Logistic Biplot by Conjugate Gradient Algorithms and Iterated SVD

Mathematics

José Luis Vicente-Villardón¹  Jose Giovany Babativa-Márquez¹ 

[1] Department of Statistics, University of Salamanca, 37008 Salamanca, Spain;

关键词: binary data;    logistic biplot;    optimization methods;    conjugate gradient algorithm;    coordinate descent algorithm;    MM algorithm;   

DOI  :  10.3390/math9162015

来源: DOAJ

【 摘 要 】

Multivariate binary data are increasingly frequent in practice. Although some adaptations of principal component analysis are used to reduce dimensionality for this kind of data, none of them provide a simultaneous representation of rows and columns (biplot). Recently, a technique named logistic biplot (LB) has been developed to represent the rows and columns of a binary data matrix simultaneously, even though the algorithm used to fit the parameters is too computationally demanding to be useful in the presence of sparsity or when the matrix is large. We propose the fitting of an LB model using nonlinear conjugate gradient (CG) or majorization–minimization (MM) algorithms, and a cross-validation procedure is introduced to select the hyperparameter that represents the number of dimensions in the model. A Monte Carlo study that considers scenarios with several sparsity levels and different dimensions of the binary data set shows that the procedure based on cross-validation is successful in the selection of the model for all algorithms studied. The comparison of the running times shows that the CG algorithm is more efficient in the presence of sparsity and when the matrix is not very large, while the performance of the MM algorithm is better when the binary matrix is balanced or large. As a complement to the proposed methods and to give practical support, a package has been written in the R language called BiplotML. To complete the study, real binary data on gene expression methylation are used to illustrate the proposed methods.

【 授权许可】

Unknown