论文信息 - On Genetic Algorithms for Boolean Matrix Factorization

On Genetic Algorithms for Boolean Matrix Factorization

Matrix factorization or factor analysis is an important task in the analysis of high dimensional real world data. There are several well known methods and algorithms for factorization of real data but they are rather inefficient when dealing with binary information. In this paper we introduce background and initial version of genetic algorithm for binary matrix factorization.

Václav Snásel | Jan Platos | Pavel Krömer

[1] H. Sebastian Seung,et al. Algorithms for Non-negative Matrix Factorization , 2000, NIPS.

[2] Michael W. Berry,et al. Algorithms and applications for approximate nonnegative matrix factorization , 2007, Comput. Stat. Data Anal..

[3] M. Dianati,et al. An Introduction to Genetic Algorithms and Evolution , 2002 .

[4] Zoubin Ghahramani,et al. Modeling Dyadic Data with Binary Latent Factors , 2006, NIPS.

[5] Claude Sammut,et al. Genetic and Evolutionary Algorithms , 2017, Encyclopedia of Machine Learning and Data Mining.

[6] Dorothea Heiss-Czedik,et al. An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[7] Michael W. Berry,et al. Document clustering using nonnegative matrix factorization , 2006, Inf. Process. Manag..

[8] Ales Keprt. Using Blind Search and Formal Concepts for Binary Factor Analysis , 2004, DATESO.

[9] Václav Snásel,et al. Binary Factor Analysis with Help of Formal Concepts , 2004, CLA.