Implementing boolean matrix factorization

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2008.

Cite

CITATION STYLE

APA

Neruda, R., Snášel, V., Platoš, J., Krömer, P., Húsek, D., & Frolov, A. A. (2008). Implementing boolean matrix factorization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5163 LNCS, pp. 543–552). https://doi.org/10.1007/978-3-540-87536-9_56

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free