Sparse logistic functional principal component analysis for binary data

From MaRDI portal
Publication:2108927

DOI10.1007/S11222-022-10190-3zbMATH Open1502.62028arXiv2109.08009OpenAlexW4312115622MaRDI QIDQ2108927FDOQ2108927


Authors: Rou Zhong, Shishi Liu, Haocheng Li, Jingxiao Zhang Edit this on Wikidata


Publication date: 20 December 2022

Published in: Statistics and Computing (Search for Journal in Brave)

Abstract: Functional binary datasets occur frequently in real practice, whereas discrete characteristics of the data can bring challenges to model estimation. In this paper, we propose a sparse logistic functional principal component analysis (SLFPCA) method to handle the functional binary data. The SLFPCA looks for local sparsity of the eigenfunctions to obtain convenience in interpretation. We formulate the problem through a penalized Bernoulli likelihood with both roughness penalty and sparseness penalty terms. An efficient algorithm is developed for the optimization of the penalized likelihood using majorization-minimization (MM) algorithm. The theoretical results indicate both consistency and sparsistency of the proposed method. We conduct a thorough numerical experiment to demonstrate the advantages of the SLFPCA approach. Our method is further applied to a physical activity dataset.


Full work available at URL: https://arxiv.org/abs/2109.08009




Recommendations




Cites Work


Cited In (4)

Uses Software





This page was built for publication: Sparse logistic functional principal component analysis for binary data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108927)