Walk 'n' merge: A scalable algorithm for boolean tensor factorization

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2013, Pages 1037-1042

  Erdos, Dóra ^a   Miettinen, Pauli ^b  

^a BOSTON UNIVERSITY   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Boolean tensors; MDL principle; Random walks; Tensor factorizations

Indexed keywords

EID: 84894646522     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2013.141     Document Type: Conference Paper

References (18)

1. I. Leenen, I. Van Mechelen, P. De Boeck, and S. Rosenberg, "INDCLAS: A three-way hierarchical classes model," Psychometrika, vol. 64, no. 1, pp. 9-24, Mar. 1999.
2. P. Miettinen, "Boolean Tensor Factorizations," in ICDM '11, 2011, pp. 447-456.
3. R. Bělohlávek, C. Glodeanu, and V. Vychodil, "Optimal Factorization of Three-Way Binary Data Using Triadic Concepts," Order, Mar. 2012.
4. D. Erdo{double acute}s and P. Miettinen, "Scalable Boolean tensor factorizations using random walks," arXiv, Tech. Rep., 2013.
5. P. Miettinen, T. Mielikäinen, A. Gionis, G. Das, and H. Mannila, "The Discrete Basis Problem," IEEE Trans. Knowl. Data Eng., vol. 20, no. 10, pp. 1348-1362, Oct. 2008.
6. J. Rissanen, "Modeling by shortest data description," Automatica, vol. 14, no. 5, pp. 465-471, Sep. 1978.
7. P. Miettinen and J. Vreeken, "MDL4BMF: Minimum description length for boolean matrix factorization," Max-Planck-Institut für Informatik, Tech. Rep. MPI-I-2012-5-001, Jun. 2012.
8. E. C. Chi and T. G. Kolda, "On Tensors, Sparsity, and Nonnegative Factorizations," SIAM J. Matrix Anal. Appl., vol. 33, no. 4, pp. 1272-1299, Dec. 2012.
9. E. E. Papalexakis, C. Faloutsos, and N. D. Sidiropoulos, "Par Cube: Sparse Parallelizable Tensor Decompositions," in ECML PKDD '12, 2012, pp. 521-536.
10. B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi, "On the Evolution of User Interaction in Facebook," in WOSN '09, 2009, pp. 37-42.
11. D. Erdo{double acute}s and P. Miettinen, "Discovering facts with Boolean tensor tucker decomposition," in CIKM, 2013.
12. L. R. Tucker, "Some mathematical notes on three-mode factor analysis," Psychometrika, vol. 31, no. 3, pp. 279-311, 1966.
13. J. D. Carroll and J.-J. Chang, "Analysis of individual differences in multidimensional scaling via an N-way generalization of 'Eckart-Young' decomposition," Psychometrika, vol. 35, no. 3, pp. 283-319, 1970.
14. R. A. Harshman, "Foundations of the PARAFAC procedure: Models and conditions for an 'explanatory' multimodal factor analysis," UCLA Working Papers in Phonetics, Tech. Rep., 1970.
15. T. G. Kolda and B. W. Bader, "Tensor decompositions and applications," SIAM Review, vol. 51, no. 3, pp. 455-500, 2009.
16. A. Shashua and T. Hazan, "Non-negative tensor factorization with applications to statistics and computer vision," in ICML '05, 2005.
17. Y.-D. Kim and S. Choi, "Nonnegative Tucker Decomposition," in CVPR '07, 2007, pp. 1-8.
18. L. Cerf, J. Besson, C. Robardet, and J.-F. Boulicaut, "Closed patterns meet n-ary relations," ACM Trans. Knowl. Discov. Data, vol. 3, no. 1, 2009.