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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Berry, M.W., Browne, M.L., Amy, N., Pauca, P.V., Plemmons, R.J.: Algorithms and applications for approximate nonnegative matrix factorization. Computational Statistics & Data Analysis 52(1), 155–173 (2007)
Frolov, A.A., Sirota, A.M., Húsek, D., Muraviev, I.P., Polyakov, P.J.: Binary factorization in hopfield-like neural networks: single-step approximation and computer simulations. Neural Network Word 14, 139–152 (2004)
Frolov, A.A., Húsek, D., Muravjev, P., Polyakov, P.: Boolean Factor Analysis by Attractor Neural Network. Neural Networks, IEEE Transactions 18(3), 698–707 (2007)
Frolov, A.A., Sirota, A.M., Húsek, D., Muraviev, I., Combe, P.: Binary Factorization in Hopfield-Like Neural Autoassociator: A Promising Tool for Data Compression. In: Pearson, D., Steele, N., Albrecht, R. (eds.) Artificial Neural Nets and Genetic Algorithms, pp. 58–62. Springer, Wien (2003)
Húsek, D., Moravec, P., Snášel, V., Frolov, A.A., Řezanková, H., Polyakov, P.: Comparison of Neural Network Boolean Factor Analysis Method with Some Other Dimension Reduction Methods on Bars Problem. In: Ghosh, A., De, R.K., Pal, S.K. (eds.) PReMI 2007. LNCS, vol. 4815, pp. 235–243. Springer, Heidelberg (2007)
Jones, G.: Genetic and evolutionary algorithms. In: von Rague, P. (ed.) Encyclopedia of Computational Chemistry. John Wiley and Sons, Chichester (1998)
Keprt, A., Snášel, V.: Binary Factor Analysis with Genetic Algorithms. In: Proceedings of 4th IEEE International Workshop on Soft Computing as Transdisciplinary Science and Technology, WSTST 2005, Muroran, Japan. LNCS/LNAI, pp. 1259–1268. Springer, Heidelberg (2005)
Koyutürk, M., Grama, A., Ramakrishnan, N.: Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis. ACM Trans. Math. Softw. 32(1), 33–69 (2006)
Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization. In: NIPS, pp. 556–562 (2000)
Meeds, E., Ghahramani, Z., Neal, R.M., Roweis, S.T.: Modeling dyadic data with binary latent factors. In: Schölkopf, B., Platt, J., Hoffman, T. (eds.) Advances in Neural Information Processing Systems, vol. 19, pp. 977–984. MIT Press, Cambridge (2007)
Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1996)
Snášel, V., Húsek, D., Frolov, A.A., Řezanková, H., Moravec, P., Polyakov, P.: Bars Problem Solving - New Neural Network Method and Comparison. In: Gelbukh, A., Kuri Morales, Á.F. (eds.) MICAI 2007. LNCS (LNAI), vol. 4827, pp. 671–682. Springer, Heidelberg (2007)
Zhang, Z., Tao Li, T., Ding, C., Zhang, X.-S.: Binary Matrix Factorization with Applications. In: Proceedings of 2007 IEEE International Conference on Data Mining (ICDM 2007), pp. 391–400 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Neruda, R., Snášel, V., Platoš, J., Krömer, P., Húsek, D., Frolov, A.A. (2008). Implementing Boolean Matrix Factorization. In: Kůrková, V., Neruda, R., Koutník, J. (eds) Artificial Neural Networks - ICANN 2008. ICANN 2008. Lecture Notes in Computer Science, vol 5163. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87536-9_56
Download citation
DOI: https://doi.org/10.1007/978-3-540-87536-9_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87535-2
Online ISBN: 978-3-540-87536-9
eBook Packages: Computer ScienceComputer Science (R0)