Binary Matrix Factorisation via Column Generation

by   Reka A. Kovacs, et al.

Identifying discrete patterns in binary data is an important dimensionality reduction tool in machine learning and data mining. In this paper, we consider the problem of low-rank binary matrix factorisation (BMF) under Boolean arithmetic. Due to the NP-hardness of this problem, most previous attempts rely on heuristic techniques. We formulate the problem as a mixed integer linear program and use a large scale optimisation technique of column generation to solve it without the need of heuristic pattern mining. Our approach focuses on accuracy and on the provision of optimality guarantees. Experimental results on real world datasets demonstrate that our proposed method is effective at producing highly accurate factorisations and improves on the previously available best known results for 15 out of 24 problem instances.


page 1

page 2

page 3

page 4


Binary Matrix Factorisation and Completion via Integer Programming

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

Low-Rank Boolean Matrix Approximation by Integer Programming

Low-rank approximations of data matrices are an important dimensionality...

Joint Antenna Selection and Phase-Only Beamforming Using Mixed-Integer Nonlinear Programming

In this paper, we consider the problem of joint antenna selection and an...

Revisiting column-generation-based matheuristic for learning classification trees

Decision trees are highly interpretable models for solving classificatio...

Bayesian Boolean Matrix Factorisation

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

Sampling and multilevel coarsening algorithms for fast matrix approximations

This paper addresses matrix approximation problems for matrices that are...

Using Background Knowledge to Rank Itemsets

Assessing the quality of discovered results is an important open problem...

Please sign up or login with your details

Forgot password? Click here to reset