6533b838fe1ef96bd12a3aed

RESEARCH PRODUCT

BMaD – A Boolean Matrix Decomposition Framework

Andrey TyukinJörg WickerStefan Kramer

subject

Matrix (mathematics)Theoretical computer scienceAnd-inverter graphBoolean circuitDecomposition (computer science)Logical matrixCircuit minimization for Boolean functionsRepresentation (mathematics)Standard Boolean modelMathematics

description

Boolean matrix decomposition is a method to obtain a compressed representation of a matrix with Boolean entries. We present a modular framework that unifies several Boolean matrix decomposition algorithms, and provide methods to evaluate their performance. The main advantages of the framework are its modular approach and hence the flexible combination of the steps of a Boolean matrix decomposition and the capability of handling missing values. The framework is licensed under the GPLv3 and can be downloaded freely at http://projects.informatik.uni-mainz.de/bmad.

yearjournalcountryeditionlanguage
2014-01-01
https://doi.org/10.1007/978-3-662-44845-8_40