Bayesian Boolean Matrix Factorisation

by   Tammo Rukat, et al.
University of Oxford
University of Birmingham
Athens University of Economics and Business

Boolean matrix factorisation aims to decompose a binary data matrix into an approximate Boolean product of two low rank, binary matrices: one containing meaningful patterns, the other quantifying how the observations can be expressed as a combination of these patterns. We introduce the OrMachine, a probabilistic generative model for Boolean matrix factorisation and derive a Metropolised Gibbs sampler that facilitates efficient parallel posterior inference. On real world and simulated data, our method outperforms all currently existing approaches for Boolean matrix factorisation and completion. This is the first method to provide full posterior inference for Boolean Matrix factorisation which is relevant in applications, e.g. for controlling false positive rates in collaborative filtering and, crucially, improves the interpretability of the inferred patterns. The proposed algorithm scales to large datasets as we demonstrate by analysing single cell gene expression data in 1.3 million mouse brain cells across 11 thousand genes on commodity hardware.


page 14

page 15

page 16

page 17

page 18

page 19

page 21


Boolean Matrix Factorization and Noisy Completion via Message Passing

Boolean matrix factorization and Boolean matrix completion from noisy ob...

Bayesian Nonparametric Boolean Factor Models

We build upon probabilistic models for Boolean Matrix and Boolean Tensor...

TensOrMachine: Probabilistic Boolean Tensor Decomposition

Boolean tensor decomposition approximates data of multi-way binary relat...

Efficiently Factorizing Boolean Matrices using Proximal Gradient Descent

Addressing the interpretability problem of NMF on Boolean data, Boolean ...

MEBF: a fast and efficient Boolean matrix factorization method

Boolean matrix has been used to represent digital information in many fi...

Binary Matrix Factorisation via Column Generation

Identifying discrete patterns in binary data is an important dimensional...

Binary Matrix Factorisation and Completion via Integer Programming

Binary matrix factorisation is an essential tool for identifying discret...

Please sign up or login with your details

Forgot password? Click here to reset