Noisy and Incomplete Boolean Matrix Factorizationvia Expectation Maximization

05/29/2019
by   Lifan Liang, et al.
0

Probabilistic approach to Boolean matrix factorization can provide solutions robustagainst noise and missing values with linear computational complexity. However,the assumption about latent factors can be problematic in real world applications.This study proposed a new probabilistic algorithm free of assumptions of latentfactors, while retaining the advantages of previous algorithms. Real data experimentshowed that our algorithm was favourably compared with current state-of-the-artprobabilistic algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/25/2019

Scalable Probabilistic Matrix Factorization with Graph-Based Priors

In matrix factorization, available graph side-information may not be wel...
research
01/28/2019

From-Below Boolean Matrix Factorization Algorithm Based on MDL

During the past few years Boolean matrix factorization (BMF) has become ...
research
10/27/2020

C-SALT: Mining Class-Specific ALTerations in Boolean Matrix Factorization

Given labeled data represented by a binary matrix, we consider the task ...
research
06/18/2021

Boolean Matrix Factorization with SAT and MaxSAT

The Boolean matrix factorization problem consists in approximating a mat...
research
05/17/2023

Algorithms for Boolean Matrix Factorization using Integer Programming

Boolean matrix factorization (BMF) approximates a given binary input mat...
research
01/05/2018

Closed-form marginal likelihood in Gamma-Poisson factorization

We present novel understandings of the Gamma-Poisson (GaP) model, a prob...
research
08/15/2023

Adaptive Noise Covariance Estimation under Colored Noise using Dynamic Expectation Maximization

The accurate estimation of the noise covariance matrix (NCM) in a dynami...

Please sign up or login with your details

Forgot password? Click here to reset