17 citations · 40 across the 13 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019★ 2 cited
Boolean matrix factorization meets consecutive ones property
Nikolaj Tatti, Pauli Miettinen
Boolean matrix factorization is a natural and a popular technique for summarizing binary matrices. In this paper, we study a problem of Boolean matrix factorization where we additi…
cs.DS2013★ 4 cited
Scalable Boolean Tensor Factorizations using Random Walks
Dóra Erdős, Pauli Miettinen
Tensors are becoming increasingly common in data mining, and consequently, tensor factorizations are becoming more and more important tools for data miners. When the data is binary…