DeepAI AI Chat
Log In Sign Up

TensOrMachine: Probabilistic Boolean Tensor Decomposition

by   Tammo Rukat, et al.

Boolean tensor decomposition approximates data of multi-way binary relationships as product of interpretable low-rank binary factors, following the rules of Boolean algebra. Here, we present its first probabilistic treatment. We facilitate scalable sampling-based posterior inference by exploitation of the combinatorial structure of the factor conditionals. Maximum a posteriori decompositions feature higher accuracies than existing techniques throughout a wide range of simulated conditions. Moreover, the probabilistic approach facilitates the treatment of missing data and enables model selection with much greater accuracy. We investigate three real-world data-sets. First, temporal interaction networks in a hospital ward and behavioural data of university students demonstrate the inference of instructive latent patterns. Next, we decompose a tensor with more than 10 billion data points, indicating relations of gene expression in cancer patients. Not only does this demonstrate scalability, it also provides an entirely novel perspective on relational properties of continuous data and, in the present example, on the molecular heterogeneity of cancer. Our implementation is available on GitHub:


page 7

page 12

page 14


Bayesian Boolean Matrix Factorisation

Boolean matrix factorisation aims to decompose a binary data matrix into...

Geometric All-Way Boolean Tensor Decomposition

Boolean tensor has been broadly utilized in representing high dimensiona...

Bayesian Nonparametric Boolean Factor Models

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

Bayesian predictive modeling of multi-source multi-way data

We develop a Bayesian approach to predict a continuous or binary outcome...

BAREB: A Bayesian repulsive biclustering model for periodontal data

Preventing periodontal diseases (PD) and maintaining the structure and f...

Dynamic Programming in Rank Space: Scaling Structured Inference with Low-Rank HMMs and PCFGs

Hidden Markov Models (HMMs) and Probabilistic Context-Free Grammars (PCF...