SearcharxivSearch

arXiv subjects

Adolphus Wagala

Publications and source records attributed to Adolphus Wagala.

3 recordsLinked to original sources

A Joint Bayesian Boolean Matrix Factorization with Application to Chromosomal Copy Number Alterations in Multiple Myeloma

Boolean matrix factorization provides an interpretable framework for discovering latent binary patterns in high-dimensional data, yet existing methods typically analyze a single binary matrix or factorize multiple matrices independently, failing to exploit shared latent structure across related datasets. We propose Joint Bayesian Boolean Matrix Factorization (JBBMF), a model that simultaneously factorizes two related binary matrices through a shared latent Boolean pattern matrix and dataset-specific loading matrices. To capture dependence between paired datasets, we introduce a conditional prior linking the loading matrices, allowing latent factors to persist or change across conditions while preserving a common interpretable representation. The model combines Boolean matrix factorization with a Bernoulli observation model and conjugate priors, yielding closed-form full conditional distributions and an efficient Gibbs sampler for posterior inference,uncertainty quantification for latent factors, reconstructed matrices, and noise parameters. Simulation studies demonstrate that jointly modeling related binary datasets substantially improves recovery of shared latent factors compared with independently applying standard Boolean matrix factorization to each dataset, while maintaining high reconstruction accuracy. We apply JBBMF to paired chromosomal copy number alteration profiles from multiple myeloma patients collected at diagnosis and relapse. The analysis identifies recurrent chromosomal alteration signatures shared between disease stages and quantifies the uncertainty of these findings. \texttt{JBBMF} offers a flexible and interpretable Bayesian model for the joint analysis of related binary datasets in genomics and other application domains.

stat.ME

A Bayesian Boolean Matrix Factorization with Application to Copy Number Analysis in Cancer

Binary data factorization is common, but real-valued methods ignore discreteness and yield hard-to-interpret factors. Boolean Matrix Factorization (BooMF) instead decomposes a binary matrix into two lower-rank binary matrices via logical AND and OR, expressing the data as a Boolean disjunction of interpretable patterns. In cancer genomics, BooMF can reveal coordinated feature changes that may drive tumor evolution, unlike rotational or additive decompositions. Most existing BooMF methods are heuristic, greedy, sensitive to initialization, prone to local optima, and do not support principled model selection or uncertainty quantification. We introduce Bayesian Boolean Matrix Factorization (BBMF), a fully conjugate generative model with sparsity-inducing priors. It enforces Boolean constraints, yields interpretable latent factors with coherent uncertainty quantification, and admits Gibbs sampling with closed-form full conditionals. Because cancer evolution often involves widespread, near-simultaneous chromosome-number changes (e.g., whole-genome duplication followed by instability and selection), Boolean factorizations capture these patterns more naturally than additive models. Applied to arm-level copy-number alteration data in multiple myeloma, where entries indicate presence/absence of chromosomal-arm amplifications, BBMF finds a small set of interpretable bicliques linking patient subsets to recurrently co-altered chromosomal arms, providing a compact, biologically meaningful summary of tumor heterogeneity and demonstrating BBMF's utility for uncovering discrete latent structure in complex binary data.

stat.ML

PLS Generalized Linear Regression and Kernel Multilogit Algorithm (KMA) for Microarray Data Classification

We implement extensions of the partial least squares generalized linear regression (PLSGLR) due to Bastien et al. (2005) through its combination with logistic regression and linear discriminant analysis, to get a partial least squares generalized linear regression-logistic regression model (PLSGLR-log), and a partial least squares generalized linear regression-linear discriminant analysis model (PLSGLRDA). These two classification methods are then compared with classical methodologies like the k-nearest neighbours (KNN), linear discriminant analysis (LDA), partial least squares discriminant analysis (PLSDA), ridge partial least squares (RPLS), and support vector machines(SVM). Furthermore, we implement the kernel multilogit algorithm (KMA) by Dalmau et al. (2015)and compare its performance with that of the other classifiers. The results indicate that for both un-preprocessed and preprocessed data, the KMA has the lowest classification error rates.

stat.CO