3 citations · 6 across the 4 of their papers we have counts for
4 papers
On Minimally Non-Firm Binary Matrices
Reka Agnes Kovacs
For a binary matrix X, the Boolean rank br(X) is the smallest integer k for which X equals the Boolean sum of k rank-1 binary matrices, and the isolation number i(X) is the maximum…
Binary Matrix Factorisation and Completion via Integer Programming
Reka A. Kovacs, Oktay Gunluk, Raphael A. Hauser
Binary matrix factorisation is an essential tool for identifying discrete patterns in binary data. In this paper we consider the rank-k binary matrix factorisation problem (k-BMF)…
Binary Matrix Factorisation via Column Generation
Reka A. Kovacs, Oktay Gunluk, Raphael A. Hauser
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 b…
Low-Rank Boolean Matrix Approximation by Integer Programming
Reka Kovacs, Oktay Gunluk, Raphael Hauser
Low-rank approximations of data matrices are an important dimensionality reduction tool in machine learning and regression analysis. We consider the case of categorical variables,…