Sciweavers

132 search results - page 1 / 27
» Sparse Boolean Matrix Factorizations
Sort
View
CLA
2007
13 years 6 months ago
Formal Concepts as Optimal Factors in Boolean Factor Analysis: Implications and Experiments
Boolean factor analysis aims at decomposing an objects × attributes Boolean matrix I into a Boolean product of an objects × factors Boolean matrix A and a factors × attributes B...
Radim Belohlávek, Vilém Vychodil
DATESO
2008
156views Database» more  DATESO 2008»
13 years 6 months ago
Developing Genetic Algorithms for Boolean Matrix Factorization
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 fa...
Václav Snásel, Jan Platos, Pavel Kr&...
SDM
2012
SIAM
233views Data Mining» more  SDM 2012»
11 years 7 months ago
On Finding Joint Subspace Boolean Matrix Factorizations
Finding latent factors of the data using matrix factorizations is a tried-and-tested approach in data mining. But finding shared factors over multiple matrices is more novel prob...
Pauli Miettinen
ISNN
2007
Springer
13 years 10 months ago
Regularized Alternating Least Squares Algorithms for Non-negative Matrix/Tensor Factorization
Nonnegative Matrix and Tensor Factorization (NMF/NTF) and Sparse Component Analysis (SCA) have already found many potential applications, especially in multi-way Blind Source Separ...
Andrzej Cichocki, Rafal Zdunek