Boolean Matrix Decomposition Task
(Redirected from boolean matrix factorization)
Jump to navigation
Jump to search
A Boolean Matrix Decomposition Task is a Matrix Decomposition Task that is restricted to boolean matrices.
- AKA: Boolean Matrix Decomposition, Boolean Matrix Factorization, Binary Matrix Decomposition, Binary Matrix Factorization.
- See: Factorization.
References
- http://scholar.google.com/scholar?q=boolean+matrix+decomposition
- http://scholar.google.com/scholar?q=boolean+matrix+factorization
- http://scholar.google.com/scholar?q=binary+matrix+decomposition
- http://scholar.google.com/scholar?q=binary+matrix+factorization
2008
- (Neruda et al., 2008) ⇒ Roman Neruda, Václav Snášel, Jan Platoš, Pavel Krömer, Dušan Húsek, and Alexander A. Frolov. (2008). “Implementing Boolean Matrix Factorization.” In: Proceedings of the 18th International Conference on Artificial Neural Networks (ICANN 2008) doi:10.1007/978-3-540-87536-9_56
- ABSTRACT: Matrix factorization or factor analysis is an important task helpful in the analysis of high dimensional real world data. There are several well known methods and algorithms for factorization of real data but many application areas including information retrieval, pattern recognition and data mining require processing of binary rather than real data. Unfortunately, the methods used for real matrix factorization fail in the latter case. In this paper we introduce the background of the task, neural network, genetic algorithm and non-negative matrix facrotization based solvers and compare the results obtained from computer experiments.