Optimal Boolean Matrix Decomposition: Application to Role Engineering

Abstract-- A decomposition of a binary matrix into two matrices gives a set of basis vectors and their appropriate combination to form the original matrix. Such decomposition solutions are useful in a number of application domains including text mining, role engineering as well as knowledge discovery. While a binary matrix can be decomposed in several ways, however, certain decompositions better characterize the semantics associated with the original matrix in a succinct but comprehensive way. Indeed, one can find different decompositions optimizing different criteria matching various semantics. In this paper, we first present a number of variants to the optimal Boolean matrix decomposition problem that have pragmatic implications. We then present a unified framework for modeling the optimal binary matrix decomposition and its variants using binary integer programming. Such modeling allows us to directly adopt the huge body of heuristic solutions and tools developed for binary integer ...

• Type: Conference
• Year: 2008
• Where: ICDE
• Authors: Haibing Lu, Jaideep Vaidya, Vijayalakshmi Atluri
• Keywords: Binary Matrix Decomposition, Boolean Matrix Decomposition, Database, ICDE 2008, Matrix Decomposition Problem