Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/ISDA.2008.317 | ISDA (2) |
Keywords | Field | DocType |
genetic algorithms,important task,boolean matrix factorization,binary information,genetic algorithm,high dimensional real world,factor analysis,matrix factorization,binary matrix factorization,initial version,evolutionary computation,genetics,face,matrix decomposition,boolean algebra,data analysis | Logical matrix,Computer science,Incomplete Cholesky factorization,Matrix decomposition,Theoretical computer science,Non-negative matrix factorization,Factorization,Incomplete LU factorization,Dixon's factorization method,Quadratic sieve | Conference |
Citations | PageRank | References |
6 | 0.49 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Václav Snáel | 1 | 37 | 10.63 |
| Jan Plato | 2 | 17 | 3.30 |
| Krömer Pavel | 3 | 330 | 59.99 |