Help Privacy Policy Disclaimer
  Advanced SearchBrowse





Scalable Boolean Tensor Factorizations using Random Walks


Miettinen,  Pauli
Databases and Information Systems, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

(Preprint), 634KB

Supplementary Material (public)
There is no public supplementary material available

Erdős, D., & Miettinen, P. (2013). Scalable Boolean Tensor Factorizations using Random Walks. Retrieved from http://arxiv.org/abs/1310.4843.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-4971-0
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, it is natural to ask if we can factorize it into binary factors while simultaneously making sure that the reconstructed tensor is still binary. Such factorizations, called Boolean tensor factorizations, can provide improved interpretability and find Boolean structure that is hard to express using normal factorizations. Unfortunately the algorithms for computing Boolean tensor factorizations do not usually scale well. In this paper we present a novel algorithm for finding Boolean CP and Tucker decompositions of large and sparse binary tensors. In our experimental evaluation we show that our algorithm can handle large tensors and accurately reconstructs the latent Boolean structure.