BMaD - A Boolean Matrix Decomposition Framework
Abstract
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 .
Cite
Text
Tyukin et al. "BMaD - A Boolean Matrix Decomposition Framework." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2014. doi:10.1007/978-3-662-44845-8_40Markdown
[Tyukin et al. "BMaD - A Boolean Matrix Decomposition Framework." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2014.](https://mlanthology.org/ecmlpkdd/2014/tyukin2014ecmlpkdd-bmad/) doi:10.1007/978-3-662-44845-8_40BibTeX
@inproceedings{tyukin2014ecmlpkdd-bmad,
title = {{BMaD - A Boolean Matrix Decomposition Framework}},
author = {Tyukin, Andrey and Kramer, Stefan and Wicker, Jörg},
booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
year = {2014},
pages = {481-484},
doi = {10.1007/978-3-662-44845-8_40},
url = {https://mlanthology.org/ecmlpkdd/2014/tyukin2014ecmlpkdd-bmad/}
}